pure/research/experiments/041-batches/2026-10-08-pairs.jsonl, branch masterVerified execution runtime unifying state, persistence, and replication.
http://git.yeowoo.org/pure/atom?h=master2026-10-08T16:48:03ZResearch 137: the batch executor's stage 4 (columns read in place, comparisons counting their lanes): knapsack 10.07 to 8.25 ms (bar 8.6; b9 11.46, the compiled code 7.9), its instructions 12.2% below b9's; what is left of knapsack's gap is the per-batch interpretation (about 3 ms), not the kernels (ADD 1.7, GT 1.7, the masked set 0.55 ms); the others the same by instructions; make check's server_view_workers timed out once (the known flake), passed 3/3 alone and in a full rerun; bank queries' instructions within 0.1% of b9's, TPC-C -0.3%; the two large gaps left (matmul's nested rounds, BFS's candidate tail) the user's to choose2026-10-08T16:48:03Zeunhhunecpition205@gmail.com2026-10-08T16:48:03Zurn:sha1:59510b75aaf6781fe7dfa10f617c06d5272bd746Research 136: the batch executor's stage 3 (four-byte MUL, reductions with no lanes while every lane's e is the same, a list's cells once a batch): against b9, interleaved, matmul 40.01 to 25.97 ms, knapsack 11.47 to 10.07, roots 8.97 to 8.29, join 117.2 to 115.8, BFS and sort the same; sum0 8.69 to 1.01 (bar 1.5); matmul short of its bar (21): the nested rounds' interpretation (about 14 ms) and the matrices' making (4-5) were left out of the arithmetic; the executor alone and the bank queries' instructions as b9 (0.08%), TPC-C +0.7%; stage 4 next (knapsack's six passes to three)2026-10-08T15:53:29Zeunhhunecpition205@gmail.com2026-10-08T15:53:29Zurn:sha1:be51c8a15d4f220ea8322f3c562f1f0c51b1e8e7041 runs of b12 = d371271 (four-byte MUL) and b13 = 38f54ac (reductions with no lanes while every lane's e is the same), interleaved with b11 and b12, and their counts: matmul 36.10 to 26.56 ms (instructions -20%), roots 8.82 to 8.31 (-6.1%), the executor alone as b9 on all five2026-10-08T15:13:14Zeunhhunecpition205@gmail.com2026-10-08T15:13:14Zurn:sha1:ea79694ede16a9204d71a8effe638cf580666ed0Research 135: batch plans' stage 2 measured (b11 = 7959885 against b10, interleaved): matmul 38.18 to 36.10 ms with 4.5% fewer instructions (segments in its nested rounds), knapsack's per-batch cost 0.68 to 0.63 us but knapsack 10.35 to 10.51 ms with 1% fewer instructions (its per-element loops placed elsewhere), sum0 1,743 instructions a batch: short of 025's stage-2 bars (9.2 ms, 0.45 us, 33 ms): 025 priced a segment's instruction at 50 cycles, the counts show about 25 instructions, and a batch's cost sits in finds, bounds, read records, lane setup, masks and the deferred store's check; a list's cells once a batch measured at 3% and not made; next, per element: stage 3's four-byte MUL (matmul 21 ms)2026-10-08T14:52:44Zeunhhunecpition205@gmail.com2026-10-08T14:52:44Zurn:sha1:6828a7d07f9de815c858a295124f6bcde9bd861aResearch 134: batch plans' stage 1 measured (b10 = a6fabf0 against b9, interleaved): knapsack's per-batch cost 0.90 to 0.68 us and knapsack 11.48 to 10.34 ms, short of 025's bars (0.60 us, 10.3 ms): 025 counted the pass's per-instruction head as lookups; sum0 2,330 to 1,822 instructions a batch (bar 1,550); matmul 40.0 to 38.2 ms with the same instructions and BFS 24.04 to 24.31 with 0.2% fewer (placement); sum0's 8.69 to 6.13 ms mostly the compiler now vectorizing the reductions' first loop; the executor alone the same instructions; what is left a batch is the pass's Val handling (stage 2); 041 runs.sh pairs, pairs and counts data2026-10-08T14:16:39Zeunhhunecpition205@gmail.com2026-10-08T14:16:39Zurn:sha1:7770574b327238213c07fccc813b575277231c61