Lattice-Based Folding Achieves Post-Quantum Recursive Zero-Knowledge Proofs
First lattice-based folding scheme secures recursive SNARKs against quantum attack by replacing discrete logarithm commitments with Module SIS.
Modular Cryptography Enables Expressive Verifiable Databases
QEDB is a new protocol that uses specialized cryptographic data structures to verify complex SQL queries on large databases, yielding constant-size proofs.
Game-Theoretic Model Quantifies MEV-Boost Auction Inefficiency and Strategic Latency Dominance
A game-theoretic model formalizes MEV-Boost auctions, demonstrating how latency and strategic bidding, not maximal value, drive block selection, quantifying auction inefficiency.
Generic Compiler Upgrades Mild SNARKs to Fully Succinct, Transforming Verifiable Computation
A new cryptographic compiler generically transforms slightly succinct arguments into fully succinct SNARKs, simplifying trustless scaling architecture.
Distributed Vector Commitments Enable Stateless Transaction Validation
The introduction of Distributed Vector Commitments allows validators to cryptographically verify transactions against a short block commitment, eliminating massive state storage.
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.
Expander Signatures Enable Fine-Grained Resource-Light Transaction Verification
A new digital signature primitive enables a powerful signer to pre-generate all signatures and release constant-size expander keys for resource-constrained devices to verify a growing set of transactions.
Strategyproof PoS Protocol Resists Rational Byzantine Collusion Improving Finality
CoBRA transforms Proof-of-Stake to withstand rational adversaries, securing finality against hybrid collusion and ensuring true incentive compatibility.
Formalizing MEV as a Game to Quantify Mitigation Strategies
Game theory formalizes the MEV supply chain, proving unconstrained transaction ordering creates a systemic welfare loss, unlocking quantified mitigation via mechanism design.
