Transaction Encryption and Ordering Randomization Mitigate Extractable Value
A new mechanism design model integrates transaction encryption and execution randomization to eliminate block producer control, ensuring provably fair transaction ordering and system integrity.
Off-Chain Influence Proofness Establishes New Fair Transaction Mechanism Desideratum
A new economic primitive, Off-Chain Influence Proofness, reveals EIP-1559's vulnerability to miner censorship, mandating cryptographic auction adoption.
Decentralized Proving Markets Secure Verifiable Computation Outsourcing Efficiency
This paper introduces a mechanism design framework for a decentralized proving market, transforming zero-knowledge proof generation into a competitive, economically efficient service.
Game Theory and C-NORM Metric Secure Decentralized Proof-of-Stake Bootstrapping
Foundational game-theoretic analysis introduces C-NORM, a novel centralization metric, proving ideal Proof-of-Stake bootstrapping protocols must satisfy incentive compatibility.
Off-Chain Influence Proofness Secures Transaction Fee Mechanism Design
Introducing "Off-Chain Influence Proofness," a new desideratum proving that EIP-1559 enables miner censorship threats, which a Cryptographic Second Price Auction can mitigate.
Zero-Knowledge Mechanisms Enable Private Rules with Public Verifiability
This framework introduces a new cryptographic primitive that allows mechanism rules to remain secret while using ZKPs to publicly verify incentive compatibility and outcomes, removing the need for a trusted mediator.
Cryptographic Whistleblowing Secures Protocols against Smart Collusion Incentives
This research introduces Cryptographic Whistleblowing, a mechanism design primitive that uses provable on-chain penalties to enforce honesty against financially rational colluders.
Concurrent Proposers and Conditional Tips Enforce Economic Censorship Resistance
Introducing conditional tips across concurrent block proposers creates a mechanism design solution, establishing a Proposer's Dilemma to enforce timely transaction inclusion.
Mechanism Design Characterizes Decentralized Verifiable Computation Incentives
This research fundamentally characterizes incentive mechanisms for verifiable computation, balancing decentralization against execution efficiency in strategic environments.
Decoupling Transaction Ordering from Execution Is the Key to Systemic MEV Mitigation
A new Decoupled Execution and Ordering framework enforces fair sequencing by committing to order before content is visible, neutralizing predatory MEV.
Threshold Cryptography Enforces Fair Transaction Ordering Mitigating MEV
A distributed threshold cryptosystem decouples transaction ordering from content knowledge, mathematically eliminating frontrunning risk and centralizing MEV incentives.
Time-Bound Signatures Mitigate MEV by Enforcing Transaction Inclusion Deadlines
A modified Schnorr signature cryptographically ties transaction validity to block height, eliminating rational producer MEV deferral and ensuring fairer ordering.
Active Block Producers Create Transaction Fee Mechanism Impossibility
Mechanism design proves that maximal extractable value fundamentally prevents simultaneous incentive compatibility and welfare maximization.
SAKA Mechanism Circumvents Transaction Fee Impossibility Theorem
Research establishes a mechanism design impossibility for simple fee structures, then introduces the SAKA mechanism to achieve incentive-compatibility and high welfare by formalizing searcher roles.
Mechanism Design Enforces Truthful Consensus Using Staked Collateral
A novel revelation mechanism leverages staked assets to ensure validators' truthfulness, resolving consensus disputes by making block proposal honesty the unique subgame perfect equilibrium.
Mechanism Design Enforces Truthful Consensus, Mitigating Disputes in Proof-of-Stake
Applying economic revelation mechanisms to PoS protocols ensures truthful block proposal as the unique equilibrium, fundamentally enhancing network robustness.
Application-Layer Mechanism Design Eliminates MEV Guaranteeing Provable Strategy Proofness
Research shifts MEV mitigation from consensus to smart contracts, using batch processing and a potential function to ensure arbitrage resilience and fairer DeFi markets.
Impossibility of Off-Chain Influence Proofness in Transaction Fee Mechanisms
A new impossibility theorem proves no transaction fee mechanism can simultaneously satisfy all prior properties and be resistant to off-chain miner influence.
Restaking Sybil-Proofness: An Impossibility Theorem Limits Slashing Mechanisms
A formal proof establishes that no single slashing mechanism can simultaneously deter both single and multi-identity Sybil attacks, revealing a foundational trade-off in economic security.
Reasonable-World Assumption Solves Zero Miner Revenue Impossibility Theorem
A new mechanism design incorporates honest user assumptions to achieve asymptotically optimal miner revenue, resolving a core theoretical conflict.
Time-Averaged Commitment Smooths MEV Auctions, Decentralizing Transaction Ordering
Introducing the Smooth-Running Auction, a mechanism using Time-Averaged Commitments to decouple block value from proposer revenue, stabilizing MEV and promoting decentralization.
Mechanism Design Establishes Truthful Equilibrium in Blockchain Consensus
Applying game theory's revelation mechanisms directly to consensus disputes creates a unique, subgame perfect equilibrium that structurally compels truthful block validation.
Zero-Knowledge Proof of Training Secures Federated Consensus
Research introduces ZKPoT consensus, leveraging zk-SNARKs to cryptographically verify machine learning contributions without exposing private training data or model parameters.
Smallest Collusions Define Transaction Fee Mechanism Vulnerability
This research reveals that if a blockchain's transaction fee mechanism can be exploited by a two-party collusion, it is inherently vulnerable to any larger collusive group, simplifying security analysis.
Blockchain Digital Courts Enforce Agreements, Surpassing Traditional Legal Systems
This research introduces a novel "digital court" smart contract, leveraging behavioral incentives to enable self-enforcing agreements on blockchains, circumventing traditional legal enforcement.
Designing Fair Transaction Fee Mechanisms for Leaderless Blockchains
This research introduces a game-theoretic model and a novel auction mechanism, FPA-EQ, ensuring fair and efficient transaction processing in emerging leaderless blockchain architectures.
Zero-Knowledge Mechanisms Enable Private, Verifiable Commitments without Mediators
This framework leverages zero-knowledge proofs for private mechanism commitment and execution, ensuring verifiable properties without disclosure or mediators.
Zero-Knowledge Proofs Enable Private, Verifiable Mechanism Commitment without Mediators
Zero-knowledge proofs enable verifiable commitment to hidden mechanisms, preserving proprietary information and eliminating trusted intermediaries from economic interactions.
Hidden Mechanisms with Zero-Knowledge Proofs for Private Verifiable Commitment
This research enables verifiable, private mechanism execution without mediators, leveraging zero-knowledge proofs to conceal rules while ensuring compliance.
