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

	Commit message (Collapse)	Author	Age	Files	Lines
*	Research 132 and 133 corrected: the per-batch cost was icount's three rounds ↵	eunhhu	12 days	1	-2/+2
\| \| \| \|	over one round's batches, 3x too high; about 2,300 instructions (0.33 us) in a small block, 0.90 us in knapsack's (38% of its time, not 20%)
*	Research 133: register tiles measured (132's deciding experiment): past the ↵	eunhhu	12 days	1	-0/+82
	bar on roots (0.71x the compiled code's cycles a step), not on knapsack (4x) or BFS (2.4x), as NEON has no gather and a tile's lanes go out and in one by one; tight passes of the batch executor's own shape in the same run at 1.2x (BFS) and 0.4x (knapsack, clang): the shape is right and the 3x is implementation, so 132's A (a batch program made once at load, loops tight by type, width and stride, fewer passes) is the way; tiles kept aside for chains of arithmetic; 132, 024 and CHECKPOINT say so