Linear Prover Time Unlocks Scalable Zero-Knowledge Proof Generation
Orion achieves optimal linear prover time and polylogarithmic proof size, resolving the ZKP scalability bottleneck for complex on-chain computation.
Decoupling Fair Ordering from Consensus Unlocks High-Performance BFT
SpeedyFair decouples transaction ordering from consensus, using parallel processing to achieve a $1.5times-2.45times$ throughput increase over state-of-the-art fair ordering protocols.
Mechanism Design Balances Decentralization and Efficiency in Verifiable Computation
New game-theoretic mechanisms characterize the decentralization-efficiency trade-off, enabling provably optimal design for verifiable computation markets.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning
ZKPoT consensus uses zk-SNARKs to verify machine learning contributions privately, resolving the privacy-verifiability trade-off for decentralized AI.
Hierarchical Consensus Enhances Blockchain Scalability and Fault Tolerance
A novel hierarchical consensus algorithm boosts blockchain transaction throughput and reduces latency by balancing workload across dynamic, multi-layered nodes.
Folding Schemes Enable Efficient Recursive Zero-Knowledge Arguments
A new cryptographic primitive, the folding scheme, dramatically reduces recursive proof overhead, unlocking practical incrementally verifiable computation.
