Transparent Polynomial Commitment Achieves Succinct Proofs without Trusted Setup
A novel polynomial commitment scheme achieves cryptographic transparency and logarithmic verification, eliminating the reliance on a trusted setup for scalable zero-knowledge proofs.
Distributed ZK Proof Generation Unlocks Practical Rollup Scalability
Pianist, a fully distributed ZKP system, parallelizes proof generation to resolve the prover bottleneck, enabling hyper-scalable, practical ZK-Rollup architectures.
Hyper-Efficient Prover Unlocks Universal Transparent Zero-Knowledge Scaling
This new HyperPlonk scheme achieves linear prover time for universal transparent SNARKs, fundamentally accelerating verifiable computation for all decentralized applications.
Direct Communication Protocol Secures Data Availability Sampling Efficiency
PANDAS uses direct communication and a two-phase seeding/consolidation model to meet the 4-second DAS deadline, ensuring data availability despite malicious nodes.
Compositional Formal Verification Secures DAG Consensus Protocol Architectures
A new compositional framework using TLA+ achieves reusable formal verification for DAG consensus, halving proof effort and ensuring robust safety assurances for next-generation architectures.
Zero-Knowledge Authenticators Decouple Public Blockchain Transparency from Private Policy
Zero-Knowledge Authenticators introduce a primitive for policy-private on-chain authentication, securing complex governance rules without public exposure.
Zero-Knowledge Proof of Training Secures Private Federated Learning Consensus
ZKPoT consensus validates machine learning contributions privately using zk-SNARKs, balancing efficiency, security, and data privacy for decentralized AI.
Zero-Knowledge Proof of Training Secures Private Decentralized Federated Learning
ZKPoT consensus verifiably proves model contribution quality via zk-SNARKs, fundamentally securing private, scalable decentralized AI.
Decentralized ZK-Rollups Achieve Data Availability and MEV Resistance
A novel L2 architecture separates node roles and uses a Proof of Luck mechanism to secure decentralization and prevent transaction reordering attacks.
