pure/research/experiments/040-against-c/2026-10-05-forms.jsonl, branch masterVerified execution runtime unifying state, persistence, and replication.
http://git.yeowoo.org/pure/atom?h=master2026-10-05T18:36:25Z125: forms and newton runs named; BFS's time after the graph's load is the generic code's (steps 0.1%), what the tier needs for it (a list's count as a changing value); 023 cites words at e2e56dd2026-10-05T18:36:25Zeunhhunecpition205@gmail.com2026-10-05T18:36:25Zurn:sha1:a099d63e2322f5ae17e8fbdc51d6cc020638a5dc040 forms.c: matmul's inner loop in the forms the tier may make it (index 20.7 ms, pointer with multiply-add 13.1, apart 10.0, with checks 10.2, a bit tested before each load 13.4): the position's multiply and the pre-load branch cost, the checks hardly; 023 section 5 says so and what comes first (pointer induction, then a full list's copy)2026-10-05T17:53:24Zeunhhunecpition205@gmail.com2026-10-05T17:53:24Zurn:sha1:8c0c409ec5032a39bf9181198a24f25cca90d5fb