Cryptographic Fair Ordering Secures Decentralized Sequencers against MEV Extraction
A Byzantine-Fault-Tolerant protocol uses zero-knowledge proofs to enforce transaction ordering based on network latency, mitigating sequencer MEV and censorship.
Asymmetric Verification Secures Fair Transaction Ordering with Succinct Proofs
Asymmetric verification decouples expensive fair ordering computation from efficient verification, mitigating MEV and enabling scalable BFT consensus.
Ethereum Nears 10,000 Transactions per Second with New Scaling Tech
Ethereum is on the cusp of a major scalability breakthrough, poised to handle 10,000 transactions per second through innovative new technology.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning
ZKPoT leverages zk-SNARKs to prove model performance without revealing private data, solving the privacy-efficiency trade-off in decentralized AI.
Proof-of-Useful-Work Embeds Zero-Knowledge Proof Generation into Consensus
A new Proof-of-Useful-Work consensus protocol secures the chain by making general-purpose ZK-SNARK computation the core mining puzzle, democratizing verifiable computation.
PANDAS Protocol Secures Scalable Data Availability Sampling against Latency
PANDAS, a novel two-phase network protocol, leverages direct communication and PBS to meet the stringent 4-second deadline for large-scale data availability sampling.
Zero-Knowledge Proof of Training Secures Private Decentralized AI Consensus
A new ZKPoT consensus leverages zk-SNARKs to verify model training integrity without revealing private data, solving the privacy-efficiency dilemma.
Dual-Proof Rollups Enable Configurable Cost-Finality Trade-Offs
This research pioneers a dual-proof rollup system, integrating ZK-STARKs and TEEs to deliver configurable finality and flexible security-cost trade-offs for Layer 2 solutions.
Sublinear Memory Zero-Knowledge Proofs Democratize Verifiable Computation
A novel zero-knowledge proof system achieves sublinear memory scaling, fundamentally enabling privacy-preserving verifiable computation on ubiquitous resource-constrained devices.
GPU Bottlenecks Hinder Zero-Knowledge Proof Scalability and Adoption
This research identifies Number-Theoretic Transform as the primary GPU bottleneck for Zero-Knowledge Proofs, proposing architectural and tuning solutions to unlock verifiable computing at scale.
Achieving Statistical Non-Malleable Zero-Knowledge in Four Rounds
A novel four-round zero-knowledge argument achieves statistical non-malleability, advancing cryptographic proof systems beyond computational security.
Verifiable Data Aggregation Secures Decentralized Oracle Networks
A novel framework integrates cryptographic proofs with oracle aggregation, ensuring off-chain data integrity for robust smart contract execution.
ZKPoT: Private, Efficient Consensus for Federated Blockchain Learning
A novel Zero-Knowledge Proof of Training consensus mechanism secures federated learning, validating model contributions privately and efficiently on blockchains.
Sublinear-Space Zero-Knowledge Proving for Resource-Constrained Devices
A novel sublinear-space zero-knowledge prover reframes proof generation as tree evaluation, enabling efficient on-device verifiable computation for widespread adoption.
