Novel Recursive Commitment Scheme Achieves Transparent, Efficient Zero-Knowledge Proofs
LUMEN introduces a recursive polynomial commitment scheme and PIOP protocol, eliminating the trusted setup while maintaining zk-SNARK efficiency, securing rollup scalability.
Fractal Commitments Enable Universal Logarithmic-Size Verifiable Computation
This new fractal commitment scheme recursively compresses polynomial proofs, achieving truly logarithmic verification costs for universal computation without a trusted setup.
Decentralized Functional Encryption Secures Multi-Party Private Computation without Trust
This new cryptographic primitive enables multiple independent parties to compute joint functions on encrypted data, eliminating the central authority trust bottleneck.
Cryptographic Proof Systems Decouple Computation and Trustless Verification
Cryptographic proof systems enable trustless outsourcing of complex computation, drastically reducing verification cost for resource-constrained clients.
Proof of Crowdsourcing Work Transforms Wasted Mining Energy into Useful Computation
Proof of Crowdsourcing Work (PoCW) leverages miner computation for general crowdsourced tasks, establishing a dual-purpose, energy-efficient consensus mechanism.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning Consensus
A novel Zero-Knowledge Proof of Training (ZKPoT) consensus uses zk-SNARKs to validate model contributions privately, eliminating PoS centralization risk.
Zero-Knowledge Proof of Training Secures Federated Learning Consensus
A new ZKPoT mechanism uses zk-SNARKs to validate machine learning model contributions privately, resolving the efficiency and privacy conflict in blockchain-secured AI.
Nil Message Compute Redefines Decentralized Computation beyond Blockchain Consensus
Nil Message Compute introduces a cryptographic framework for secure, private, and scalable decentralized computation, transcending traditional blockchain limitations.
Nil Message Compute: Decentralized Computation beyond Blockchain Consensus
A novel cryptographic framework enables secure, private, and scalable decentralized computation by eliminating reliance on traditional blockchain consensus mechanisms.
Scaling zkSNARKs through Application and Proof System Co-Design
This research introduces "silently verifiable proofs" and a co-design approach to drastically reduce communication costs for scalable, privacy-preserving analytics.
Boundless Mainnet Activates, Revolutionizing Blockchain Verifiable Compute
Boundless’s mainnet activation introduces Proof of Verifiable Work, establishing a direct market for useful computation crucial for internet-scale blockchain applications.
Boundless Mainnet Activates Verifiable Compute Protocol
Boundless launches Proof of Verifiable Work, establishing a decentralized market for zero-knowledge computation to scale all blockchains.
