What does Concurrent Coupling and Blackboard Reuse conclude, in numbers, about “Field Tools and Checker Specifications: the Concurrency Ledger, Four-Kit Clauses and a Pre-Registered Test”?
Answer: Chapter 8 gives the Concurrency Coupling and Blackboard Reuse Calculator, a checker table, the ledger rhythm and a pre-registered test needing 156 records per arm. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.
Scope of the numbers: Parameters are illustrative, data are synthetic, and every figure is generated by the book's programs; the book is not individual business advice and promises no speed-up. Chapter 1 shows where the peak comes from, near 6.78 windows under illustrative parameters.
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: 156
| A. repeat-failure share 0.30 vs 0.18 | 156 encounters per arm |
| if coupled arm is 0.15 | 95 per arm |
| if coupled arm is 0.21 | 289 per arm |
| if coupled arm is 0.24 | 676 per arm |
| B. reuse rate 0.30 vs 0.45 | 62 entries |
| C. simulated power at n | 156: 0.792 (2,000 studies) |
| false-alarm rate when arms are equal | 0.043 |
Show the full program
# Chapter 8. p82: pre-registered sample sizes and a power check.
# Test 1: share of pitfall encounters that repeat a failure another
# node already posted; isolated arm p0 = 0.30, coupled arm p1 = 0.18
# (illustrative). One-sided two-proportion z test, alpha 0.05, power
# 0.80. Test 2: reuse rate (entries cited by another node / entries
# written); null 0.30, target 0.45, one-sample, same alpha and power.
# A Monte Carlo of 2000 simulated studies checks the power of test 1.
import math
import random
from statistics import NormalDist
Z = NormalDist()
ALPHA, POWER = 0.05, 0.80
def n_two(p0, p1):
za, zb = Z.inv_cdf(1 - ALPHA), Z.inv_cdf(POWER)
pb = (p0 + p1) / 2
num = (za * math.sqrt(2 * pb * (1 - pb))
+ zb * math.sqrt(p0 * (1 - p0) + p1 * (1 - p1))) ** 2
return math.ceil(num / (p0 - p1) ** 2)
def n_one(p0, p1):
za, zb = Z.inv_cdf(1 - ALPHA), Z.inv_cdf(POWER)
num = (za * math.sqrt(p0 * (1 - p0))
+ zb * math.sqrt(p1 * (1 - p1))) ** 2
return math.ceil(num / (p1 - p0) ** 2)
def power_mc(p0, p1, n, runs, rng):
za = Z.inv_cdf(1 - ALPHA)
hits = 0
for _ in range(runs):
x0 = x1 = 0
for _ in range(n):
if rng.random() < p0:
x0 += 1
if rng.random() < p1:
x1 += 1
pb = (x0 + x1) / (2 * n)
se = math.sqrt(2 * pb * (1 - pb) / n)
if se > 0 and (x0 - x1) / n / se > za:
hits += 1
return hits / runs
if __name__ == "__main__":
n1 = n_two(0.30, 0.18)
print("A. repeat-failure share 0.30 vs 0.18: {:,} encounters per"
" arm".format(n1))
for p1 in (0.15, 0.21, 0.24):
print(" if coupled arm is {:.2f}: {:,} per arm".format(
p1, n_two(0.30, p1)))
n2 = n_one(0.30, 0.45)
print("B. reuse rate 0.30 vs 0.45: {:,} entries".format(n2))
rng = random.Random(41182)
pw = power_mc(0.30, 0.18, n1, 2000, rng)
print("C. simulated power at n = {:,}: {:.3f} ({:,} studies)".format(
n1, pw, 2000))
alpha = power_mc(0.30, 0.30, n1, 2000, rng)
print(" false-alarm rate when arms are equal: {:.3f}".format(alpha))Single source and citation
Fan, Y. (2026). Topological Coupling of Concurrent Multi-Core Operations: Lock-Free Blackboard Signalling and Cross-Node Emergent Gains (Version 1.0.0), Chapter 8: Field Tools and Checker Specifications: the Concurrency Ledger, Four-Kit Clauses and a Pre-Registered Test. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-411 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026411,
author = {Fan, Yafu},
title = {Topological Coupling of Concurrent Multi-Core Operations: Lock-Free Blackboard Signalling and Cross-Node Emergent Gains},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Serial Fraction and Coherence Overhead: Why Throughput Has a Peak
- Chapter 2 · Fitting σ and κ from Throughput Records: Least Squares, Bootstrap Intervals and Design
- Chapter 3 · Exclusive-Create Locks: Conflict Rates, the Cost of Moving On, and Lost Updates
- Chapter 4 · The Append-Only Blackboard: Lock-Free Reads, Hash De-duplication and the Cost of Subscribing
- Chapter 5 · Coupling Topology and Search: Isolation, Ring, Small World and Full Connection on NK Landscapes
- Chapter 6 · Emergence as Measurable Reuse: Hypergraph Incidence and the Net Gain of Coupling
- Chapter 7 · Eastern and Western Sources Examined: Sunzi on Division, the Analects on Harmony, Windowless Monads and Smith's Division of Labour