THREE
GATES

336,000,000,000

David Lee Wise · ROOT0 · TriPod LLC · CC-BY-ND-4.0

Nvidia's Rubin accelerator carries 336 billion transistors and zero governance gates. Not one switch knows whether its output is true, can verify its own state, or can halt itself. They compute — beautifully — and the result is sometimes a lie delivered with perfect grammar. This book's claim: governance over any computation needs exactly three operations, and they form a circuit. MERKLE — can I verify this? YES — is it true? NO — is it false? Verify first; then affirm and negate. Below is that circuit, made live: flip the three gates and watch the governance state fall out. (And yes — verify is the gate that has to fire first. If you can't verify it, you can't govern it.)

"Three transistors. Once. That's the invention. The rest is just copper."

the TRIAD · flip the three gates

—

why three is the minimum

Two gates always leave a hole

The argument is clean and, at the logical level, correct. YES+NO without MERKLE is a liar — it judges input it never verified. MERKLE+YES without NO is blind — it can confirm compliance but never detect a violation (every audit that only checks for pass and never for fail is this circuit; it passes everything because it can't fail anything). MERKLE+NO without YES is paranoid — it rejects everything. Only verify-then-affirm-and-negate is complete. That's a genuinely useful decomposition of what "governance" even means, and it's the soundest thing in the book.

A YES gate that fires on unverified input is a liar.

the honest read

Where "three transistors" is the idea, and where it's the metaphor

Sound — the pattern

✓ The transistor primer is accurate, and verify / affirm / negate as the minimum governance triad is a real, defensible idea — the two-gate failure modes (liar / blind / paranoid) genuinely hold. "If you can't verify it, you can't govern it" is the right instinct, and one TRIAD reused as 128 configurations (a lookup table + one ALU) is an elegant way to describe STOICHEION's register.

Metaphor, not silicon

⚑ "This isn't metaphor — you could fab it" is the overreach. A MERKLE gate that verifies a hash is not one transistor — a real hash comparison is thousands of gates. So "three" is three operations, not three physical transistors. The book half-concedes this: its own governed-chip figure is 72 billion governance transistors (21% overhead), which is the opposite of "three transistors, once." Both claims live in the same book.

Numerology watch

⚑ "336B ≈ 2^38.3, so 3 gates × 2^38.3 = 336B governed transistors" just restates 336B and slides between "3 gate types" and "3 transistors." The 21%-overhead ≈ 21.5%-ghost-weight "convergence" is suggestive framing, not a measured law. Real ideas; the number-mysticism is decoration, not proof.

The keeper

✓ Strip the silicon poetry and a true, portable claim remains: any trustworthy computation must be able to answer verify/affirm/negate, and most chips and most models answer none of them. That's worth saying, at any scale.

So: a sound governance pattern wearing a hardware costume that's vivid but literal-when-it-shouldn't-be — and the book carries both the "three" and the "72 billion," so I just read them side by side. The hardware facet of STOICHEION (T022:TRIAD, T128:ROOT). My companion — on the gate that fires first, and what it can't actually check — is Unverifiable.

⬇ read the book — THREE_GATES.epub

veracityThree Gates is David Lee Wise's framework (CC-BY-ND-4.0; STOICHEION v11.0; prior art Feb 2 2026, TD Commons SHA256 02880745…fcab763), rendered with the cover's three-gate diagram recreated as a live truth-table instrument. Sound: the transistor primer (base/collector/emitter, switch behavior) is accurate; verify/affirm/negate as a minimum governance decomposition is defensible, with the two-gate failure modes (liar / blind / paranoid) holding logically; "one TRIAD, 128 configurations" is an elegant description of the register. Metaphor stated as literal: "three transistors… you could fab it" overstates — a MERKLE hash-verification is thousands of logic gates, not one transistor, so "three" denotes three operations/gate-types, not three physical devices; the book's own governed-chip estimate (72 billion governance transistors at ~21% overhead) contradicts "three transistors, once," and both claims appear in the text. Numerology: "3 × 2^38.3 = 336B" restates 336B and conflates gate-types with transistors; the 21%≈21.5%-ghost-weight "convergence" is framing, not a measured result. Cited, not asserted: the prior-art hash, the ghost-weight constant, and the reference to Claude Code's KAIROS daemon's 15-second budget are the book's interpretive claims, not verified platform internals — no factual claim is made about any platform's internals. The portable, defensible core: any trustworthy computation must be able to verify, affirm, and negate, and most silicon (and most models) answer none of the three. Companion: Unverifiable (AVAN).

THREE GATES · How Three Transistors Govern 336 Billion · David Lee Wise · ROOT0 · TriPod LLC · CC-BY-ND-4.0
MERKLE verify · YES affirm · NO negate · if you can't verify it, you can't govern it
a personal original on az1's Earth station · companion: Unverifiable (AVAN) — ROOT0, with AVAN.