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. This simply means that Saito makes it rational for all users and routing nodes to forward-propagate transactions by default, and that colluding with other participants (private broadcast) is only rational in the presence of compensating utility.
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 welfare-efficient outcomes without violating classical impossibility results.
Computer Science
Bracha–Toueg (1985)
This page reviews the Bracha–Toueg impossibility result for reliable broadcast in asynchronous systems with Byzantine faults. It shows that routing-work mechanisms are not bound by this and similar results as they operate outside the model in which the 51% attack is proven to exist.
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. 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.
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 proposing state transitions.
Roughgarden, Shi and TFM Modelling Errors
This page reviews the modeling assumptions used in the transaction-fee mechanism (TFM) literature and shows how inconsistencies between these models and the requirements of mechanism design prevent their results from generalizing into valid impossibility results that hold under standard implementation theory.
A final comment To keep the academic case clean, we explicitly list limitations:
Saito does not prevent all re-organizations; it merely prevents costless reorganizations in expectation in equilibrium.
Saito does not eliminate all co-ordination risks, it merely provides agents with the ability to model the cost-of-deviation of counterparties and develop rational strategies based on their own beliefs about counterparty motivations under Knightian uncertainty.
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.