pure/docs/design/021-past-c.md, branch master Verified execution runtime unifying state, persistence, and replication. http://git.yeowoo.org/pure/atom?h=master 2026-10-05T08:19:32Z Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's forms by hand beat C only packed, narrow and read ahead (123) 2026-10-05T08:19:32Z eunhhu necpition205@gmail.com 2026-10-05T08:19:32Z urn:sha1:2654f58ae6a7d0fcaf356b0f4cd69038b3eaf00c Measure an index for a stored list's slices outside the list: three times a tree's seek, still seven times C's (021) 2026-10-05T06:57:08Z eunhhu necpition205@gmail.com 2026-10-05T06:57:08Z urn:sha1:c1d1fdde86832f8c8528135975b660b00f1a3678 Say what a search's floor is with stored lists as trees: 373 ns a node to find a slice against C's 21 (021) 2026-10-05T06:53:59Z eunhhu necpition205@gmail.com 2026-10-05T06:53:59Z urn:sha1:4e482aa02cac1e36acaa2dd5585d34f64c7edcac Say how a search gets past C: event lists as arrays, a directory for stored keys, then a JIT, with criteria (021) 2026-10-05T05:31:58Z eunhhu necpition205@gmail.com 2026-10-05T05:31:58Z urn:sha1:ce4be172725d0aca0aa55409d4077bf788374dde