What does Concurrent Coupling and Blackboard Reuse conclude, in numbers, about “Emergence as Measurable Reuse: Hypergraph Incidence and the Net Gain of Coupling”?
Answer: Chapter 6 writes emergence as cross-node reuse and a net-gain interval on a hypergraph incidence matrix; a reading lag of one day removes 0.944 of the repeated pitfalls seen under isolation.
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: 0.944
| A. failures by read lag and subscription share | |||
| setting | failures | repeats | multi-node pits |
| isolated | 239 | 142 | 64 |
| lag 7, all topics | 176 | 79 | 43 |
| lag 3, all topics | 131 | 34 | 24 |
| lag 1, all topics | 105 | 8 | 8 |
| lag 0, all topics | 97 | 0 | 0 |
| lag 1, half topics | 176 | 79 | 48 |
| B. lag 1 removes 0.944 of the isolated repeats |
Show the full program
# Chapter 6. p62: the same pitfall stepped on by several nodes.
# 6 nodes work 20 days; each day each node makes 3 draws from 120
# pitfalls (Zipf-like weights, exponent 0.8) sorted into 10 topics. A
# node avoids a pitfall it failed before, or one visible on the board
# in a topic it subscribes to; a failure is posted and becomes visible
# after a read lag of L days. Repeat failures = failures beyond the
# first on each pitfall; multi-node pits = pitfalls failed by 2 or more
# nodes. Same draws for every setting; all values illustrative.
import random
NODES, DAYS, DRAWS, PITS, TOPICS = 6, 20, 3, 120, 10
def draws(rng):
w = [1.0 / (k + 1) ** 0.8 for k in range(PITS)]
return [[[rng.choices(range(PITS), w)[0] for _ in range(DRAWS)]
for _ in range(NODES)] for _ in range(DAYS)]
def subs(share, rng):
out = []
for _ in range(NODES):
t = list(range(TOPICS))
rng.shuffle(t)
out.append(set(t[:int(round(share * TOPICS))]))
return out
def run(plan, lag, sub):
own = [set() for _ in range(NODES)]
posted = {}
fails = {}
for day, today in enumerate(plan):
for v, picks in enumerate(today):
for p in picks:
seen = (p in posted and lag is not None
and posted[p] + lag <= day
and p % TOPICS in sub[v])
if p in own[v] or seen:
continue
own[v].add(p)
fails.setdefault(p, set()).add(v)
posted.setdefault(p, day)
total = repeat = multi = 0
for p in fails:
k = len(fails[p])
total += k
repeat += k - 1
if k >= 2:
multi += 1
return total, repeat, multi
if __name__ == "__main__":
rng = random.Random(41162)
plan = draws(rng)
full = subs(1.0, rng)
half = subs(0.5, rng)
print("A. failures by read lag and subscription share")
print(" setting failures repeats multi-node pits")
cases = (("isolated", None, full), ("lag 7, all topics", 7, full),
("lag 3, all topics", 3, full), ("lag 1, all topics", 1, full),
("lag 0, all topics", 0, full), ("lag 1, half topics", 1, half))
base = None
for name, lag, sub in cases:
t, r, m = run(plan, lag, sub)
if base is None:
base = r
print(" {:<20} {:>8} {:>7} {:>15}".format(name, t, r, m))
t, r, m = run(plan, 1, full)
print("B. lag 1 removes {:.3f} of the isolated repeats".format(
1.0 - r / base))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 6: Emergence as Measurable Reuse: Hypergraph Incidence and the Net Gain of Coupling. 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 7 · Eastern and Western Sources Examined: Sunzi on Division, the Analects on Harmony, Windowless Monads and Smith's Division of Labour
- Chapter 8 · Field Tools and Checker Specifications: the Concurrency Ledger, Four-Kit Clauses and a Pre-Registered Test