pure - Verified execution runtime unifying state, persistence, and replication.

	Commit message (Collapse)	Author	Age	Files	Lines
*	Read a slice's bucket and first cell some rounds ahead of the loop that ↵	eunhhu	2026-10-05	1	-1/+6
\| \| \| \|	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)
*	Design 022: stored lists as arrays with a bucket index fitted to the keys ↵	eunhhu	2026-10-05	6	-7/+283
\| \| \| \|	searched, narrow columns, a JIT with registers and loop guards, read ahead; criteria first
*	Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's ↵	eunhhu	2026-10-05	72	-0/+1024
\| \| \| \|	forms by hand beat C only packed, narrow and read ahead (123)
*	Measure an index for a stored list's slices outside the list: three times a ↵	eunhhu	2026-10-05	2	-0/+113
\| \| \| \|	tree's seek, still seven times C's (021)
*	Say what a search's floor is with stored lists as trees: 373 ns a node to ↵	eunhhu	2026-10-05	3	-0/+75
	find a slice against C's 21 (021)