pure/research/experiments/038-past-c, branch masterVerified execution runtime unifying state, persistence, and replication.
http://git.yeowoo.org/pure/atom?h=master2026-10-05T09:52:22ZRead a slice's bucket and first cell some rounds ahead of the loop that opens it, read an item and find it in key bits as one, branch back once a round: BFS core 19.6 to 14.9 ms (022)2026-10-05T09:52:22Zeunhhunecpition205@gmail.com2026-10-05T09:52:22Zurn:sha1:fccde3d57f9eafaf9d91edd666fe8128e619a4e5Design 022: stored lists as arrays with a bucket index fitted to the keys searched, narrow columns, a JIT with registers and loop guards, read ahead; criteria first2026-10-05T08:29:23Zeunhhunecpition205@gmail.com2026-10-05T08:29:23Zurn:sha1:58b8d5b291422a0c12db590eefbad6efe96cc6deMeasure 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:32Zeunhhunecpition205@gmail.com2026-10-05T08:19:32Zurn:sha1:2654f58ae6a7d0fcaf356b0f4cd69038b3eaf00cMeasure 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:08Zeunhhunecpition205@gmail.com2026-10-05T06:57:08Zurn:sha1:c1d1fdde86832f8c8528135975b660b00f1a3678Say 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:59Zeunhhunecpition205@gmail.com2026-10-05T06:53:59Zurn:sha1:4e482aa02cac1e36acaa2dd5585d34f64c7edcac