Proof-Carrying Messages Decouple ZK Verifiability and Cross-Chain Interoperability
Introducing Proof-Carrying Interchain Messages and a Verifier Router to achieve composable, stateless, and proof-agnostic cross-domain verifiability.
Efficient Post-Quantum Polynomial Commitments Unlock Scalable Zero-Knowledge Cryptography
Greyhound, a lattice-based polynomial commitment scheme, delivers post-quantum security and vastly smaller proof sizes, enabling practical, future-proof zk-SNARKs.
Quantum Supremacy Consensus Secures Blockchain against Classical Attackers
Proof of Quantum Work (PoQW) leverages quantum supremacy for a consensus primitive that is quantum-safe, low-energy, and classically intractable.
Error Correction Codes Achieve ASIC-Resistant Decentralized Proof-of-Work Consensus
ECCVCC leverages time-varying syndrome decoding puzzles to fundamentally suppress ASIC efficiency, sustaining long-term blockchain decentralization.
Sublinear Vector Commitments Enable Stateless Client Scalability
Developing a new vector commitment scheme that achieves sublinear complexity for both update information and proof maintenance, fundamentally optimizing stateless client operation.
Quick Merkle Database Unifies State Storage and Proofs for Extreme Scalability
Introducing the Quick Merkle Database, a unified, append-only architecture that resolves state management I/O bottlenecks, enabling millions of updates per second.
Prioritized Broadcast Slashes Asynchronous Consensus Communication Complexity.
A committee-based prioritized broadcast protocol cuts Byzantine consensus communication costs by $O(n)$, unlocking scalable asynchronous state replication.
Formal Analysis Improves Avalanche Consensus Latency and Security Trade-Off
Rigorous analysis of Snow consensus exposes an unfavorable latency-security trade-off, resolved by a protocol modification for superior performance.
Lattice SNARKs Achieve Post-Quantum Security, Public Verifiability, and Recursion
Researchers created the first lattice-based SNARK that is post-quantum secure and recursively composable, future-proofing verifiable computation.
