Impossibility of Collusion-Resistant, Truthful, and Non-Manipulable Transaction Mechanisms
New impossibility theorem proves no non-trivial, collusion-resistant, and truth-inducing deterministic transaction mechanism can exist, fundamentally limiting MEV mitigation.
Expander Signatures Enable Efficient Verification on Resource-Limited Devices
This new cryptographic primitive decouples intensive signature generation from constant-size verification, securing resource-constrained blockchain participation.
LLMs Automate Property Generation for Smart Contract Formal Verification
PropertyGPT leverages large language models and retrieval-augmented generation to automate the creation of formal verification properties, dramatically reducing the manual effort required for smart contract security.
Lattice SNARKs Achieve Quasi-Optimal Efficiency via Novel Vanishing Polynomial Commitment
A new lattice-based commitment scheme enables the first quasi-optimal, quantum-resistant SNARKs, making secure, scalable verifiable computation practical.
Decentralized Rollup Sequencers Using Set Consensus Ensure Full L2 Autonomy
Set Byzantine Consensus creates a decentralized arranger service, eliminating the sequencer bottleneck and enabling fully autonomous Layer 2 rollups.
Layered MEV Mitigation Ensures Transaction Fairness via Decentralized Auction Ordering
FairFlow introduces a layered protocol using decentralized auctions and randomized ordering to mitigate MEV, ensuring equitable and private transaction execution.
Constant-Time Publicly Verifiable Secret Sharing Unlocks Scalable Blockchain Primitives
This framework transforms Publicly Verifiable Secret Sharing from $O(n)$ to $O(1)$ complexity by leveraging CCA2-Secure Threshold Encryption and NIZK proofs, eliminating a critical scalability bottleneck.
Collaborative Zero-Knowledge Proofs Secure Distributed Secrets Efficiently
This research introduces Collaborative zk-SNARKs, a cryptographic primitive allowing distributed parties to prove a statement about their collective secret data without centralization, achieving near-single-prover efficiency.
Equifficient Polynomial Commitments Enable Faster, Smaller zk-SNARKs
Research introduces Equifficient Polynomial Commitments, a new primitive that yields Pari, the smallest SNARK at 160 bytes, and Garuda, a prover three times faster than Groth16.
