Hierarchical BFT with Aggregated Signatures Secures Resource-Constrained Edge Networks
A two-layer BFT architecture and aggregated signatures reduce consensus communication overhead from quadratic to linear, enabling secure, scalable edge computing.
Constant-Space Distributed Randomness via Insertion-Secure Accumulators and Delay Functions
This framework achieves scalable, unpredictable randomness by combining Verifiable Delay Functions with a new accumulator property, reducing public storage complexity to a constant.
Eliminating Threshold Cryptography Latency in Byzantine Fault Tolerant Consensus
Foundational research eliminates the inherent one-message latency price of threshold cryptography in BFT systems, enabling faster, provably secure on-chain randomness.
Practical Asynchronous BFT Achieves Superior Performance through Designated Leader Pipelining
This protocol merges leader-driven efficiency with asynchronous resilience, creating a simple, high-performance BFT mechanism for real-world decentralized systems.
Proof-of-Social-Capital Replaces Financial Stake for Decentralized Consensus
A new consensus protocol replaces financial stake with social capital, leveraging zk-proofs to democratize block production and mitigate wealth-based centralization.
Lattice-Based VDF Achieves Post-Quantum Security for Decentralized Randomness and Consensus
Papercraft, a lattice-based Verifiable Delay Function, secures leader election and randomness against quantum adversaries with a practical 7-second verification time.
Lattice Verifiable Delay Function Achieves Practical Post-Quantum Consensus Security
Papercraft introduces the first practical lattice-based VDF, securing decentralized randomness and leader election against the imminent threat of quantum adversaries.
Verifiable Delay Puzzles Enable Fair Energy-Efficient Nakamoto Consensus
The Verifiable Delay Puzzle (VDP) replaces energy-intensive Proof-of-Work with a sequential-only computation, ensuring fair, decentralized block production.
