Proof-of-Sequential-Work Secures Low-Latency Randomness and Optimal Time-Lock Security
A new Proof-of-Sequential-Work primitive fundamentally optimizes Verifiable Delay Functions, enabling robust, low-latency on-chain randomness.
Expander Signatures Enable Constant-Size Verification for Resource-Constrained Devices
Expander Signatures, a novel cryptographic primitive, decouple heavy key generation from constant-size, lightweight verification, solving the key management burden for IoT devices on-chain.
Zero-Knowledge Signature Batching Achieves Single Slot Finality for Proof-of-Stake
Cryptographic aggregation of validator signatures via zk-proofs resolves the latency-scalability tradeoff, delivering instant finality to PoS consensus.
Folding Schemes Enable Highly Efficient Recursive Zero-Knowledge Arguments
Folding schemes fundamentally re-architect recursive proofs, reducing two NP instances to one and achieving constant-time verification for massive computations.
Novel Auxiliary Mechanism Design Achieves Truthfulness, Collusion-Proofness, and Non-Zero Miner Revenue
By shifting from dominant to Bayesian incentive compatibility, this new auxiliary mechanism method breaks the zero-revenue barrier for secure transaction fee design.
Benchmarking Verkle Trees and SNARKs for Stateless Client Viability
Comparing Verkle Trees and SNARK-enabled Merkle proofs reveals a path to weak statelessness, drastically lowering validator hardware costs to secure decentralization.
Decentralized Arranger Unifies Sequencing and Data Availability via Set Consensus
A new decentralized arranger primitive leverages Set Byzantine Consensus to unify L2 sequencing and data availability, eliminating centralized trust bottlenecks.
Blaze Multi-Linear Commitment Scheme Accelerates SNARK Prover Time and Shrinks Proof Size
Blaze introduces a multi-linear polynomial commitment scheme using Repeat-Accumulate-Accumulate codes, dramatically speeding up ZK-SNARK provers and reducing proof size for scalable verifiable computation.
Deterministic Bounds Secure Committee Selection beyond Probabilistic Guarantees
A new cryptographic sortition model introduces deterministic bounds on adversarial committee influence, enabling smaller, more efficient, and verifiably secure consensus groups.
