dade5e6bb3
The real jcalixte/notes clone (570 MB pack, 1179 files) proved both index strategies are O(N_tree) and unshippable: index.write re-hashes the tree (611 s), and the index-free read_tree is 77 s cold and OOMs the mmap cache (zlib crash). Record the run in the tradeoff curve, revise the verdict to an O(depth) TreeBuilder walk, and add a handoff note with the design, firmware call sites, and bench steps for the next session.
Tradeoff curves
Where a design knob has a cost that bends — energy, latency, memory — against an interval or size, the curve and its knee live here, so the chosen default is traceable to a shape rather than a guess.
Docs index:
../README.md. Project overview:../../README.md.
| Curve | What it decides |
|---|---|
wifi-auto-sync.md |
auto_sync interval vs Wi-Fi energy (a 1/T hyperbola) — why the default is 10 min and opportunistic, not a wall-clock timer. |
epd-refresh-latency.md |
E-ink refresh latency vs rows driven — the full / full-area-partial / windowed-Y cost model behind typing responsiveness and the boot splash→editor swap. |
sync-commit-staging.md |
Commit-staging strategy vs working-tree size — add_all(["*"]) (O(tree) FAT walk) vs explicit-path (O(churn)); the walk-vs-writes split that decides whether explicit staging is worth it. |