What does Layered Interfaces and Core Fidelity conclude, in numbers, about “The Optimal Number of Layers: Gains in Reach, Cost of Upkeep and Distortion between Layers”?
Answer: With the core alone, 1,411 readers are reached and the net value is 1,411. With two layers, 3,427 readers are reached, 2,551 correct units are delivered against 67 wrong ones, and the net value is 2,166. With three layers, reach is 6,065, correct units 3,260, wrong units 145, and the net value 2,470, the highest in the table. With four layers, reach climbs to 8,269 and correct units to 3,379, wrong units rise to 165, and the net value falls to 2,298. Five layers reach 9,453 readers for a net value of 2,096; six reach 9,874 for 1,849; seven reach almost everyone, 9,977 readers, and the net value is down to 1,567.
Scope of the numbers: 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: 1411, 145, 1567, 165, 1849, 2096
| EPS 0.03, LAM 2.0, C 250.0 per extra layer | ||||||
| k | bottom D | reached | delivered | misstated | cost | net |
| 1 | 0.8 | 1,411 | 1,411 | 0 | 0 | 1,411 |
| 2 | 0.3 | 3,427 | 2,551 | 67 | 250 | 2,166 |
| 3 | -0.2 | 6,065 | 3,260 | 145 | 500 | 2,470 |
| 4 | -0.7 | 8,269 | 3,379 | 165 | 750 | 2,298 |
| 5 | -1.2 | 9,453 | 3,468 | 186 | 1,000 | 2,096 |
| 6 | -1.7 | 9,874 | 3,519 | 210 | 1,250 | 1,849 |
| 7 | -2.2 | 9,977 | 3,522 | 227 | 1,500 | 1,567 |
| optimal k = 3, net 2,470 |
Show the full program
# Chapter 4. p41: an optimal number of layers exists
# Audience and reach curve as p31 (ln b ~ N(0, 0.6), S = 0.25). Layer j
# (j = 0 is the core at D = 0.8) sits at D = 0.8 - 0.5 j and carries a
# share v(D) = min(1, max(0.2, 0.6 + 0.5 D)) of the core claims. Layers
# are derived in a chain, so layer j is accurate with (1 - EPS)^j, that
# is 0.97^j at the baseline.
# Net value = delivered units - LAM * misstated units - C * (k - 1), all
# per 10,000 readers. EPS, LAM and C are illustrative.
import math
SIG, S, N = 0.6, 0.25, 10000
EPS, LAM, C = 0.03, 2.0, 250.0
GRID = [-6.0 + 0.005 * k for k in range(2401)]
def logistic(z):
return 1.0 / (1.0 + math.exp(-z))
def share(d):
return min(1.0, max(0.2, 0.6 + 0.5 * d))
def evaluate(k, eps):
layers = [(0.8 - 0.5 * j, share(0.8 - 0.5 * j), (1 - eps) ** j)
for j in range(k)]
reach, good, bad = [], [], []
for z in GRID:
w = math.exp(-0.5 * z * z) / math.sqrt(2.0 * math.pi) * 0.005
ts = [logistic((SIG * z - d) / S) for d, _, _ in layers]
j = max(range(k), key=lambda i: ts[i] * layers[i][1])
reach.append(w * max(ts))
good.append(w * ts[j] * layers[j][1] * layers[j][2])
bad.append(w * ts[j] * layers[j][1] * (1 - layers[j][2]))
return [N * math.fsum(x) for x in (reach, good, bad)]
print("EPS {}, LAM {}, C {} per extra layer".format(EPS, LAM, C))
print(" k bottom D reached delivered misstated cost net")
best = None
for k in range(1, 8):
r, g, b = evaluate(k, EPS)
net = g - LAM * b - C * (k - 1)
if best is None or net > best[1]:
best = (k, net)
print("{:2d} {:9.1f} {:8,} {:10,} {:10,} {:7,} {:8,}".format(
k, 0.8 - 0.5 * (k - 1), round(r), round(g), round(b),
round(C * (k - 1)), round(net)))
print("optimal k = {}, net {:,}".format(best[0], round(best[1])))Single source and citation
Fan, Y. (2026). Impedance Matching for High-Dimensional Systems: Lossless Downward Compatibility without Core Frequency Degradation (Version 1.0.0), Chapter 4: The Optimal Number of Layers: Gains in Reach, Cost of Upkeep and Distortion between Layers. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-412 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026412,
author = {Fan, Yafu},
title = {Impedance Matching for High-Dimensional Systems: Lossless Downward Compatibility without Core Frequency Degradation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Reflection Coefficient: a Structural Analogy for Audience Mismatch
- Chapter 2 · Multi-Section Matching and the Bode–Fano Limit: Bandwidth against Depth of Match
- Chapter 3 · The Distribution of Reader Bandwidth: One Deep Text, One Rewritten Text, or Layers
- Chapter 5 · Expertise Reversal, Routing Readers and the Limits of Readability
- Chapter 6 · Bayesian Updating of Brand Belief: When Dilution Happens
- Chapter 7 · Classical Sources: "Those above the Middle", Ease and Simplicity, the Phaedrus and the Rhetoric
- Chapter 8 · The Audience Reflection Coefficient and Layered Interface Matching Calculator: Field Tools and Checker Specifications