Decentralized Agent Identity Protocol Secures Stateless Verifiable Ownership
DIAP uses immutable IPFS CIDs and ZKPs to create a stateless, privacy-preserving agent identity layer, solving the key rotation paradox.
Consensus-Integrated Proof of Useful Work Decentralizes Zero-Knowledge Proof Generation
A new consensus mechanism embeds general-purpose zk-SNARK computation as Proof of Useful Work, transforming block production into a decentralized verifiable computation marketplace.
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.
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.
Improved Batched Threshold Encryption Secures Private Transaction Ordering
This cryptographic upgrade to Batched Threshold Encryption enables scalable, private mempools, fundamentally eliminating front-running MEV.
Field-Agnostic Polynomial Commitments Accelerate Multilinear Zero-Knowledge Proofs
A new polynomial commitment scheme, BaseFold, generalizes FRI using foldable codes, eliminating field restrictions and achieving 200x faster ZK prover times.
Data Availability Encoding Becomes Zero-Overhead Polynomial Commitment Scheme
This work unifies data availability and polynomial commitment schemes, achieving zero prover overhead by cryptographically repurposing data encoding.
