What does Bicameral AI Architecture conclude, in numbers, about “The Three-Stage Pipeline: Turning Errors into Intercepted Errors”?
Answer: Chapter 3 shows that a common-factor correlation of only 0.1 makes a three-stage pipeline leak 1.87 times the independent product, and 8.65 times at 0.5.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; "bicameral" is an engineering metaphor and no model is claimed to have awareness; the book is not personalised business or engineering advice. Marked boxes separate published evidence, runnable Python calculations (23 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.1, 0.5, 1.87, 8.65
| A. s 0.10, t 0.30, g 0.10; independent leak 0.0030 | |
| rho leak ratio to product per 10,000 tasks | |
| 0.0 | 0.00300 1.00 30.0 |
| 0.1 | 0.00560 1.87 56.0 |
| 0.2 | 0.00915 3.05 91.5 |
| 0.3 | 0.01369 4.56 136.9 |
| 0.5 | 0.02595 8.65 259.5 |
| 0.7 | 0.04327 14.42 432.7 |
| 0.9 | 0.06856 22.85 685.6 |
| B. Monte Carlo check at rho 0.5, n | 200,000: 0.02571 |
| C. halving one stage's miss rate at rho 0.5: | |
| halve s: leak 0.01619 | |
| halve t: leak 0.01928 | |
| halve g: leak 0.01619 |
Show the full program
# Chapter 3. p31: three-stage leak with a common factor.
# A bad outcome escapes only if the strategy layer errs (rate s), the
# translation check misses it (rate t) and the deterministic gate
# misses it (rate g). One-factor Gaussian model: each stage's latent
# z = sqrt(rho) F + sqrt(1 - rho) e. rho = 0 gives the plain product
# s * t * g. The integral over F is exact (Simpson); a Monte Carlo
# run with a fixed seed checks one row. Illustrative rates.
import math
import random
from statistics import NormalDist
ND = NormalDist()
S, T, G = 0.10, 0.30, 0.10
def all_fail(rates, rho, steps=2000):
cuts = [ND.inv_cdf(p) for p in rates]
if rho <= 0.0:
return math.prod(rates)
a, b = math.sqrt(rho), math.sqrt(1.0 - rho)
h = 16.0 / steps
terms = []
for i in range(steps + 1):
f = -8.0 + i * h
w = 1 if i in (0, steps) else (4 if i % 2 else 2)
v = ND.pdf(f)
for c in cuts:
v *= ND.cdf((c - a * f) / b)
terms.append(w * v)
return math.fsum(terms) * h / 3.0
def mc(rates, rho, n, rng):
cuts = [ND.inv_cdf(p) for p in rates]
a, b = math.sqrt(rho), math.sqrt(1.0 - rho)
hit = 0
for _ in range(n):
f = rng.gauss(0.0, 1.0)
if all(a * f + b * rng.gauss(0.0, 1.0) < c for c in cuts):
hit += 1
return hit / n
if __name__ == "__main__":
base = S * T * G
print("A. s {:.2f}, t {:.2f}, g {:.2f}; independent leak {:.4f}"
.format(S, T, G, base))
print(" rho leak ratio to product per 10,000 tasks")
for rho in (0.0, 0.1, 0.2, 0.3, 0.5, 0.7, 0.9):
lk = all_fail([S, T, G], rho)
print(" {:.1f} {:.5f} {:>6.2f} {:>6.1f}"
.format(rho, lk, lk / base, lk * 10000))
rng = random.Random(41004)
n = 200000
print("B. Monte Carlo check at rho 0.5, n = {:,}: {:.5f}".format(
n, mc([S, T, G], 0.5, n, rng)))
print("C. halving one stage's miss rate at rho 0.5:")
for name, r in (("s", [S / 2, T, G]), ("t", [S, T / 2, G]),
("g", [S, T, G / 2])):
print(" halve {}: leak {:.5f}".format(name, all_fail(r, 0.5)))Single source and citation
Fan, Y. (2026). Bicameral AI Architecture: Fusing Long-Context Holographic Strategy Models with Local Deterministic Execution Agents (Version 1.0.0), Chapter 3: The Three-Stage Pipeline: Turning Errors into Intercepted Errors. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-410 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026410,
author = {Fan, Yafu},
title = {Bicameral AI Architecture: Fusing Long-Context Holographic Strategy Models with Local Deterministic Execution Agents},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Correlated Errors: Where the Second Model's Gain Comes From
- Chapter 2 · Diversity Measures and the Ambiguity Decomposition: How Different Is Different Enough
- Chapter 4 · The Intent Translation Protocol: Slots, Ambiguity Entropy and Upper Bounds
- Chapter 5 · State-Sync Packets: Hash Chains, Version Vectors and Idempotency Keys
- Chapter 6 · Two-Way Correction: Gain, Noise and the Limits of Self-Correction
- Chapter 7 · Eastern and Western Classical Sources: Temple Reckoning, Breadth with Precision, and Friction
- Chapter 8 · The Empirical Loop: Field Tools and Checker Specifications