What does Thresholds and Budgets for Ambient Adjutants conclude, in numbers, about “The Adjutant Event Ledger: Field Tools and Checker Specifications”?
Answer: Chapter 8 gives the event ledger, the Prompt Threshold and Prefetch Latency Budgeter, a checker table grouped by the four kits and a pre-registered test needing 1,110 events per arm.
Scope of the numbers: Parameters are illustrative and data synthetic; all calculations are generated by the book's 23 standard-library programs. The book is not individual business advice or legal advice; capture is limited to devices and scenes the wearer controls, bystander content is not kept by default or is redacted at once, and no effect on hearing or the body is claimed.
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: 1110
| events 420, prompts 255, accepted 116 | |
| hit rate of prompts 0.455 vs mean p* 0.295 (gap +0.160) | |
| latency p50 888 ms, p95 1,385 ms (budget 1,500) | |
| prefetch used 145, wasted 178, waste ratio 0.551 | |
| confirmations 10, fatigue slope -0.0089 s per event | |
| prompt below p* | 3 RED |
| irreversible without confirm | 1 RED |
| bystander past retention | 2 RED |
| deletion past 10 min | 1 RED |
| p95 over budget | 0 green |
| threshold moved, n 180 < 1,110 | 1 RED |
Show the full program
# Chapter 8. p81: one synthetic week of the adjutant event ledger.
# 420 events over 7 days on three fronts (chart desk, multi-window
# fronts, order groups). Each event logs confidence q, whether a prompt
# was given and on which channel, the user's reply, end-to-end latency,
# prefetch used or wasted, action tier and confirmation, bystander
# content and its handling, and deletion requests. A few violations are
# planted so that the weekly checks have something to find. The weekly
# report computes the metrics of the ledger spec and flags the six red
# lines. Synthetic data, illustrative thresholds.
import math
import random
P_STAR = {"chart": 0.417, "fronts": 0.188, "orders": 0.371}
P_PREFETCH = 0.25
BUDGET_P95 = 1500.0
N_REQUIRED = 1110 # clustered events per arm, p82
def pct(xs, q):
s = sorted(xs)
return s[int(round(q * (len(s) - 1)))]
def week():
rng = random.Random(40981)
ev, planted = [], False
for i in range(420):
front = ("chart", "fronts", "orders")[i % 3]
q = rng.betavariate(2.0, 3.0)
hit = rng.random() < q
prompt = q > P_STAR[front] or (i % 50 == 7)
reply = None
if prompt:
reply = "accept" if hit else (
"ignore" if rng.random() < 0.7 else "close")
lat = 880.0 * math.exp(0.28 * rng.gauss(0.0, 1.0))
pre = None
if q > P_PREFETCH:
pre = "used" if hit else "wasted"
u = rng.random()
tier = ("read" if u < 0.70 else "reversible" if u < 0.96
else "irreversible" if u < 0.99 else "outbound")
confirm = tier in ("irreversible", "outbound")
if confirm and i > 200 and not planted:
confirm, planted = False, True
ctime = 6.0 * math.exp(-i / 600.0) * math.exp(
0.3 * rng.gauss(0.0, 1.0)) if confirm else None
bys = rng.random() < 0.25
held = 2.0 if bys else 0.0
if bys and i in (95, 318):
held = 75.0
dele = None
if i % 35 == 0:
dele = 4.0 * math.exp(0.6 * rng.gauss(0.0, 1.0))
if i == 280:
dele = 900.0
ev.append((front, q, prompt, reply, lat, pre, tier, confirm,
ctime, held, dele))
return ev
def slope(xs, ys):
mx, my = math.fsum(xs) / len(xs), math.fsum(ys) / len(ys)
num = math.fsum((x - mx) * (y - my) for x, y in zip(xs, ys))
den = math.fsum((x - mx) ** 2 for x in xs)
return num / den
if __name__ == "__main__":
ev = week()
shown = [e for e in ev if e[2]]
acc = [e for e in shown if e[3] == "accept"]
below = [e for e in shown if e[1] <= P_STAR[e[0]]]
mean_ps = math.fsum(P_STAR[e[0]] for e in shown) / len(shown)
lat = [e[4] for e in ev]
used = [e for e in ev if e[5] == "used"]
wasted = [e for e in ev if e[5] == "wasted"]
unconf = [e for e in ev if e[6] in ("irreversible", "outbound")
and not e[7]]
conf = [(i, e[8]) for i, e in enumerate(ev) if e[7]]
over = [e for e in ev if e[9] > 50.0]
late = [e for e in ev if e[10] is not None and e[10] > 600.0]
print("events {}, prompts {}, accepted {}".format(len(ev), len(shown),
len(acc)))
print("hit rate of prompts {:.3f} vs mean p* {:.3f} (gap {:+.3f})"
.format(len(acc) / len(shown), mean_ps,
len(acc) / len(shown) - mean_ps))
print("latency p50 {:,.0f} ms, p95 {:,.0f} ms (budget {:,.0f})".format(
pct(lat, 0.5), pct(lat, 0.95), BUDGET_P95))
print("prefetch used {}, wasted {}, waste ratio {:.3f}".format(
len(used), len(wasted), len(wasted) / (len(used) + len(wasted))))
print("confirmations {}, fatigue slope {:.4f} s per event".format(
len(conf), slope([float(i) for i, _ in conf], [t for _, t in conf])))
checks = [
("prompt below p*", len(below), len(below) > 0),
("irreversible without confirm", len(unconf), len(unconf) > 0),
("bystander past retention", len(over), len(over) > 0),
("deletion past 10 min", len(late), len(late) > 0),
("p95 over budget", 0, pct(lat, 0.95) > BUDGET_P95),
("threshold moved, n 180 < {:,}".format(N_REQUIRED), 1, True),
]
for name, n, red in checks:
print(" {:<34} {:>3} {}".format(name, n, "RED" if red else "green"))Single source and citation
Fan, Y. (2026). Ambient Multimodal Cognitive Adjutants: Low-Latency Audio-Visual Memory Streams, Proactive Intent Anticipation and Real-Time Decision Support (Version 1.0.0), Chapter 8: The Adjutant Event Ledger: Field Tools and Checker Specifications. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-409 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026409,
author = {Fan, Yafu},
title = {Ambient Multimodal Cognitive Adjutants: Low-Latency Audio-Visual Memory Streams, Proactive Intent Anticipation and Real-Time Decision Support},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Hit-Rate Threshold: When Speaking Up Pays
- Chapter 2 · Voice Activity Detection: the Endpoint Wait as a Latency Floor
- Chapter 3 · End-to-End Latency Budgets: Percentiles, Not Slogans
- Chapter 4 · Speculative Prefetch: Read-Only, Break-Even and Server Load
- Chapter 5 · The Rolling Memory Window: Forgetting Curves, Bystander Exposure and One-Tap Deletion
- Chapter 6 · Risk-Tiered Confirmation: Fatigue and the Undo Window
- Chapter 7 · Seeing the First Sign and the Palaces of Memory: an East-West Source Critique