This section provides an organized overview of the theoretical foundations of Saito Consensus. It is intended for economists, mechanism designers, and computer scientists who wish to understand how routing-work fits into established academic frameworks.
Core Saito Documents
Saito is a Non-Revelation Equivalent Mechanism
Saito is a special kind of mechanism known in economics as an "non-revelation-equivalent mechanism" -- a kind of indirect mechanism that is not reducible to a direct mechanism under the Revelation Principle. This matters because the same factors that put Saito into this class enable it to solve problems other consensus mechanisms cannot address even in theory.
A Simple Proof of Sybil-Proof (Lancashire, Parris, 2023)
This paper provides a statistical proof that Saito Consensus is a sybil-proof routing mechanism. What this means is that Saito makes it rational for all nodes to forward-propagate transactions by default, and that colluding with other participants always reduces the speed of inclusion in expectation.
Asymmetrical Cost of Attack
The fact that non-collusion behavior provides fastest inclusion (and highest security!) in expectation is key to how Saito Consensus creates an asymmetrical cost that punishes nodes which engage in Byzantine behavior. The page explains how sustaining this cost-of-attack possible, even when such nodes form the majority of the network.
Saito Whitepaper (Lancashire, Parris, 2018)
original whitepaper, providing a brief explanation of the Tragedy of the Commons and Free Rider problems instantiate in most blockchains, and how routing work eliminates both problems on the incentive level, unleashing emergent scale and incentive compatibility.
Economics and Mechanism Design
Myerson–Satterthwaite & Green–Laffont Applicability
This page examines the conditions required for implementing welfare-efficient equilibria in informationally decentralized mechanisms, focusing on the bilateral-trade (Myerson–Satterthwaite) and public-good (Green–Laffont) impossibility theorems. It shows routing-work mechanisms fall outside the scope of these impossibility claims.
How Saito Implements Welfare-Efficient Equilibrium
This page explains how Saito achieves welfare efficiency using costly, action-based signals instead of type reports. Routing signatures create a filtered message space in which only welfare-increasing deviations are rational, allowing the mechanism to aggregate decentralized proposals into Pareto-efficient outcomes without violating classical impossibility results.
Welfare-Improving Trade Lemmas (Combinatorial Auction Theory)
This page explains why routing mechanisms are best considered combinatorial double-auctions. It establishes that any profitable deviation corresponds to a missed welfare-improving trade, and that such trades require costly message-space expansion. As a result, routing-work mechanisms are incentive-aligned: only welfare-improving deviations are profitable.
Computer Science
Bracha–Toueg (1985)
This page reviews the Bracha–Toueg impossibility result for reliable broadcast in asynchronous systems with Byzantine faults. The theorem assumes that malicious nodes can equivocate freely and without cost. Routing-work mechanisms violate this assumption by imposing asymmetric economic cost on state equivocation, and therefore operate outside the model in which the impossibility result is proven.
Dwork–Lynch–Stockmeyer (1988)
This page examines the partial-synchrony model of DLS and its implications for consensus. Classical DLS results treat equivocation and message fabrication as free actions for Byzantine actors, whereas routing-work mechanisms make such actions economically dominated. Understanding this distinction clarifies why routing-work consensus does not rely on the timing or failure assumptions in DLS.
Sybil-Proofness / Red Balloons
This page explains the logic behind sybil-proofness and the Red Balloons problem, showing why sybil creation defines the only meaningful channel for multi-path strategic deviation. It summarizes the structure of the Lancashire–Parris sybil-proofness proof and explains how sybil cost bounds deviation incentives in routing-work mechanisms.
Censorship Resistance / Taxing Fee-Exclusion
This page explains why routing work has properties of strong censorship-resistance that other mechanisms lack: attackers who censor transactions push the set of available work to competitors while reducing their own profitability in proposing state transitions and recapturing the costs of doing so in equilibrium.
Common Proof Errors in Blockchain Security
This page reviews common modeling mistakes in blockchain security analyses that routing work mechanisms show are not universally valid, such as the assumption of costless fake message creation, unverifiable actions, or unlimited adversarial communication channels. It highlights how breaking these assumptions break real-world applicability of many classical results and shows how routing-work mechanisms explicitly control these deviation channels.
Roughgarden, Shi and TFM Modelling Errors
This page reviews the modeling assumptions used in the transaction-fee mechanism (TFM) literature and shows how inconsistencies in how these models handle preferences and message spaces prevent their results from generalizing into valid impossibility results under standard implementation theory.
A final comment To keep the academic case clean, we explicitly list limitations:
Saito does not prevent all reorganizations; it merely prevents costless reorganizations in expectation in equilibrium.
Saito does not eliminate all coordination risks, it merely provides agents with the ability to model the cost-of-deviation of counterparties interacting with it through the mechanism and develop strategies based on that model.
Physical-layer attacks (eclipse, long-term censorship at the ISP level) remain out of scope for the protocol; it merely addresses profitable economic and technical deviations within the mechanism.