Pith. sign in

REVIEW 2 cited by

Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.02954 v2 pith:PRHEKOJW submitted 2023-07-06 cs.DC

classification cs.DC
keywords attacksprotocolblockchaindecentralizedsandwichaddressallowsblock
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Traditional blockchains grant the miner of a block full control not only over which transactions but also their order. This constitutes a major flaw discovered with the introduction of decentralized finance and allows miners to perform MEV attacks. In this paper, we address the issue of sandwich attacks by providing a construction that takes as input a blockchain protocol and outputs a new blockchain protocol with the same security but in which sandwich attacks are not profitable. Furthermore, our protocol is fully decentralized with no trusted third parties or heavy cryptography primitives and carries a linear increase in latency and minimum computation overhead.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Time Is Money: Incentivized Causal Transaction Ordering

    cs.CR 2026-07 conditional novelty 7.0 of 10

    A power-weighted randomized lottery with superlinear bid weights lets a user deter front-runners with a single bid that forms a subgame-perfect equilibrium.

  2. SoK: Consensus for Fair Message Ordering

    cs.DC 2024-11 conditional novelty 5.0 of 10

    A systematization of fair message ordering consensus that introduces a modular framework for adding fairness to BFT consensus and a latency-optimized variant of Themis.

Pith tools