What does Thresholds and Budgets for Ambient Adjutants conclude, in numbers, about “Seeing the First Sign and the Palaces of Memory: an East-West Source Critique”?

Answer: If only 50 minutes are kept, there are 300 segments: an unindexed search inspects 150 on average, a time index 101, and a trail of curated notes 92. Keep one day, 5,760 segments, and the unindexed search inspects 2,880, the time index 1,195, while the trail still needs only 96. Keep seven days, 40,320 segments, and the unindexed search inspects 20,160, the time index 8,109. Keep a year, 2,102,400 segments, and the unindexed search inspects 1,051,200 on average and the time index 420,529, while the trail of notes needs only 105.

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: 101, 105, 1051200, 1195, 150, 20160

keptitemsscantime indextrail
50 min30015010192
1 day5,7602,8801,19596
7 days40,32020,1608,10999
30 days172,80086,40034,606101
365 days2,102,400 1,051,200420,529105
Show the full program
# Chapter 7. p72: the palace of memory grows; what does a lookup cost?
# Capture one segment per 10 s over 16 waking hours: 5,760 a day.
# Lookup strategies, counted in items inspected:
#   scan       - unindexed store, expected N / 2;
#   time index - binary search on time, then the 60 items of +-5 min;
#                works only when the user recalls the time to +-5 min
#                (prob 0.6), otherwise falls back to the scan;
#   trail      - Bush's memex idea: curated notes (one per 15 minutes
#                kept, 64 a day) searched by binary search, then the 90
#                segments the note points to.
# A store kept for 50 minutes (p51) holds 300 segments. Illustrative.
import math

PER_DAY = 5760
NOTES_PER_DAY = 64


def costs(n_items, n_notes):
    scan = n_items / 2.0
    tidx = 0.6 * (math.log2(n_items) + 60.0) + 0.4 * scan
    trail = math.log2(max(n_notes, 2)) + 90.0
    return scan, tidx, trail


if __name__ == "__main__":
    print("  kept           items      scan   time index   trail")
    rows = [("50 min", 300, 3), ("1 day", PER_DAY, NOTES_PER_DAY),
            ("7 days", 7 * PER_DAY, 7 * NOTES_PER_DAY),
            ("30 days", 30 * PER_DAY, 30 * NOTES_PER_DAY),
            ("365 days", 365 * PER_DAY, 365 * NOTES_PER_DAY)]
    for name, n, m in rows:
        s, t, r = costs(n, m)
        print("  {:<10} {:>11,} {:>9,.0f} {:>12,.0f} {:>7,.0f}".format(
            name, n, s, t, r))

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 7: Seeing the First Sign and the Palaces of Memory: an East-West Source Critique. 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