Proof-of-Thought Secures Decentralized AI Coordination against Byzantine Malice
Proof-of-Thought, a novel consensus primitive, secures multi-agent LLM systems by rewarding the quality of reasoning, mitigating Byzantine collusion.
Asymmetric Quorums Enable Provable Subjective Trust in DAG Consensus
A new model for asynchronous consensus replaces the universal trust assumption with subjective node-specific quorums, enabling formally verifiable safety in flexible, open networks.
New ZK Protocols Achieve Optimal Linear Prover Time and Distributed Proof Generation
Cryptographers introduced new zero-knowledge protocols that achieve optimal linear-time prover complexity and enable fully distributed proof generation, accelerating ZKP adoption for scalable privacy.
Silently Verifiable Proofs Achieve Constant Communication Batch Zero-Knowledge Verification
Silently Verifiable Proofs introduce a zero-knowledge primitive that enables constant-cost batch verification, unlocking massive private data aggregation and rollup scaling.
Transparent Zero-Knowledge Proofs Achieve Optimal Prover Computation and Succinct Verification
The Libra proof system introduces a transparent zero-knowledge scheme achieving optimal linearithmic prover time, unlocking universally scalable private computation.
Hybrid Synchronous BFT Model Achieves Low Latency by Separating Message Sizes
AlterBFT introduces a hybrid synchronous model, relying on small, timely coordination messages to drastically reduce consensus latency.
Data Availability Sampling Secures Modular Blockchain Scalability
Modular architecture decouples core functions, using Data Availability Sampling and erasure coding to enable trust-minimized, mass-scale rollups.
Application-Layer Mechanism Eliminates Arbitrage and MEV in Decentralized Finance
A novel AMM mechanism processes transactions in batches using a constant potential function, guaranteeing arbitrage resilience and user incentive compatibility.
Mechanized Formal Verification Proves Absolute Bounds on Extractable Value
Formalizing MEV strategies within the Lean theorem prover provides machine-checked proofs of adversarial extraction limits, enabling provably secure DeFi.
