Polylogarithmic Polynomial Commitment Scheme Unlocks Scalable Verifiable Computation
This new polynomial commitment scheme over Galois rings achieves polylogarithmic verification, fundamentally accelerating zero-knowledge proof systems and verifiable computation.
Zero-Knowledge Proof of Training Secures Private Decentralized Federated Consensus
ZKPoT is a new cryptographic primitive using zk-SNARKs to verify model contribution without revealing private data, unlocking decentralized AI.
Verified Compilation System Ensures Foundational Smart Contract Correctness
A verified compiler system establishes a foundational correctness guarantee for smart contracts by mathematically linking source code proofs to deployed bytecode execution.
Sublinear Prover Memory Unlocks Decentralized Verifiable Computation and Privacy Scale
New sublinear-space prover reduces ZKP memory from linear to square-root complexity, enabling ubiquitous on-device verifiable computation and privacy.
Zero-Knowledge Proof of Training Secures Private Decentralized Federated Learning Consensus
ZKPoT introduces a zk-SNARK-based consensus mechanism that proves model accuracy without revealing private data, resolving the critical privacy-accuracy trade-off in decentralized AI.
Multi-Party Computation Circumvents Impossibility in Decentralized Mechanism Design for Fair Fees
Cryptographic Multi-Party Computation enables collusion-resistant transaction fee mechanisms, transforming a game-theoretic impossibility into a secure computation problem.
Accountable Safety Decouples Liveness and Finality in Proof-of-Stake Consensus
This research introduces Accountable Safety, a new PoS property that guarantees finality or provides cryptographic proof of validator misbehavior under minimal synchrony.
Threshold Encryption Secures Transaction Ordering Fairness and Mitigates Extractable Value
Threshold encryption decouples transaction submission from execution, forcing validator collusion to extract MEV, thereby enforcing order fairness.
Efficient Validated Agreement Bridges Complexity Gap for Secure State Replication
New signature-free validated Byzantine agreement protocols achieve optimal bit complexity, securing progress and external validity for high-performance state machine replication.
