Social Capital Consensus Replaces Financial Stake for Equitable Decentralization
A new ZK-enabled protocol replaces financial stake with non-transferable social capital, fundamentally re-architecting consensus for true equity and Sybil resistance.
Cryptographic Whistleblowing Secures Protocols against Smart Collusion Incentives
This research introduces Cryptographic Whistleblowing, a mechanism design primitive that uses provable on-chain penalties to enforce honesty against financially rational colluders.
Concurrent Proposers and Conditional Tips Enforce Economic Censorship Resistance
Introducing conditional tips across concurrent block proposers creates a mechanism design solution, establishing a Proposer's Dilemma to enforce timely transaction inclusion.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify decentralized model accuracy without revealing private data, solving the efficiency-privacy trade-off in federated learning.
Lattice-Based Folding Achieves Post-Quantum Recursive SNARK Efficiency
The first lattice-based folding protocol enables recursive SNARKs to achieve post-quantum security while matching the performance of pre-quantum schemes.
Optimal Asynchronous Byzantine Agreement Achieves Quadratic Communication Efficiency
A novel committee-based protocol reduces asynchronous Byzantine agreement communication from cubic to quadratic, enabling practical fault-tolerant state machine replication.
Rondo Protocol Achieves Scalable, Dynamic Distributed Randomness Beacon
The Rondo protocol introduces Batched Asynchronous Verifiable Secret Sharing with Partial Output, enabling dynamic node membership and optimal $O(n)$ message complexity for scalable, unpredictable randomness.
Recursive Structure-Preserving Commitments Enable Constant-Size Universal SNARK Setup
Fractal Commitment Schemes introduce a recursive commitment primitive that compresses the universal trusted setup into a constant size, dramatically accelerating verifiable computation deployment.
Sublinear Memory ZKPs Democratize Verifiable Computation and Privacy
A new proof system reduces ZKP memory from linear to square-root complexity, unlocking verifiable computation on resource-constrained edge devices.
