Pith. sign in

REVIEW 2 cited by

F3B: A Low-Overhead Blockchain Architecture with Per-Transaction Front-Running Protection

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 2205.08529 v3 pith:G4YQPQBY submitted 2022-05-17 cs.CR

classification cs.CR
keywords front-runningtransactionattacksblockchainconsensuslayertransactionsaddresses
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Front-running attacks, which benefit from advanced knowledge of pending transactions, have proliferated in the blockchain space since the emergence of decentralized finance. Front-running causes devastating losses to honest participants and continues to endanger the fairness of the ecosystem. We present Flash Freezing Flash Boys (F3B), a blockchain architecture that addresses front-running attacks by using threshold cryptography. In F3B, a user generates a symmetric key to encrypt their transaction, and once the underlying consensus layer has finalized the transaction, a decentralized secret-management committee reveals this key. F3B mitigates front-running attacks because, before the consensus group finalizes it, an adversary can no longer read the content of a transaction, thus preventing the adversary from benefiting from advanced knowledge of pending transactions. Unlike other mitigation systems, F3B properly ensures that all unfinalized transactions, even with significant delays, remain private by adopting per-transaction protection. Furthermore, F3B addresses front-running at the execution layer; thus, our solution is agnostic to the underlying consensus algorithm and compatible with existing smart contracts. We evaluated F3B on Ethereum with a modified execution layer and found only a negligible (0.026%) increase in transaction latency, specifically due to running threshold decryption with a 128-member secret-management committee after a transaction is finalized; this indicates that F3B is both practical and low-cost.

Discussion (0). Sign in 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. Slack and Budget Breaking in Threshold Team Production

    cs.GT 2026-07 accept novelty 7.0 of 10

    The exact worst-case budget to deter coalitional delay in threshold team production is B* = N*/(Δ+1) · (L + R₁⁺ − (Δ+1)f)⁺, achieved by a uniform timely bounty.

Pith tools