What does Thresholds and Budgets for Ambient Adjutants conclude, in numbers, about “Speculative Prefetch: Read-Only, Break-Even and Server Load”?

Answer: Without prefetch the median is 967 milliseconds, the 95th percentile 1,416 and the 99th percentile 1,697, with 0.564 of requests finished within one second. At a hit rate of 0.30 the median falls to 891 but the 95th percentile only to 1,352. At 0.60 the median is 809 and the 95th percentile 1,263. At 0.90 the median is 744, the 95th percentile 1,085 and the share within one second 0.912. At 0.99 the 95th percentile is 1,008 and the 99th percentile 1,194.

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: 0.30, 0.564, 0.60, 0.90, 0.912, 0.99

hit pp50p95p99<=1swasted per request
0.009671,4161,6970.5640.00
0.308911,3521,6520.6840.70
0.608091,2631,5510.7970.40
0.907441,0851,3480.9120.10
0.997311,0081,1940.9470.01

Key formula

\[p^* = \frac{c + v}{L + c + v}\]
Show the full program
# Chapter 4. p42: latency percentiles with speculative prefetch on and off.
# Stages as the "streaming" variant of p31. On a prefetch hit (prob p)
# the retrieval stage is a 5 ms local read and the answer stage starts
# from a pre-assembled context, so its median falls to 0.6 of the base.
# On a miss nothing changes. The same 20,000 normal draws are reused for
# every p (common random numbers). Values are illustrative.
import math
import random

N = 20000
STAGES = [  # fixed, median, sigma
    (20.0, 0.0, 0.0), (240.0, 20.0, 0.9), (0.0, 50.0, 0.4),
    (0.0, 70.0, 0.7), (0.0, 380.0, 0.45), (0.0, 110.0, 0.3),
    (0.0, 35.0, 0.25),
]


def pct(xs, q):
    s = sorted(xs)
    return s[int(round(q * (len(s) - 1)))]


if __name__ == "__main__":
    rng = random.Random(40942)
    z = [[rng.gauss(0.0, 1.0) for _ in STAGES] for _ in range(N)]
    u = [rng.random() for _ in range(N)]
    print("  hit p    p50    p95    p99   <=1s   wasted per request")
    for p in (0.0, 0.3, 0.6, 0.9, 0.99):
        tot = []
        for row, uu in zip(z, u):
            hit = uu < p
            parts = []
            for j, ((fx, med, sg), zz) in enumerate(zip(STAGES, row)):
                if hit and j == 3:
                    parts.append(5.0)
                    continue
                m = med * 0.6 if (hit and j == 4) else med
                parts.append(fx + (m * math.exp(sg * zz) if m > 0 else 0.0))
            tot.append(math.fsum(parts))
        ok = 0
        for v in tot:
            ok += v <= 1000.0
        fmt = "  {:.2f}  {:>6,.0f} {:>6,.0f} {:>6,.0f}  {:.3f}   {:.2f}"
        print(fmt.format(
            p, pct(tot, 0.5), pct(tot, 0.95), pct(tot, 0.99), ok / N,
            1.0 - p if p > 0 else 0.0))

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 4: Speculative Prefetch: Read-Only, Break-Even and Server Load. 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