aboutsummaryrefslogtreecommitdiffstats
path: root/docs
Commit message (Expand)AuthorAgeFilesLines
* Research 140: 2a's instruction counts: the workloads' modules the same, the e...eunhhu7 days1-0/+12
* Research 140, 027's stage 2a measured: whether bytes are JSON (aup's examples...eunhhu7 days2-0/+52
* Module format and executor: 027's stage 2a: BYTES_SLICE (bytes from a up to b...eunhhu7 days1-3/+8
* Research 140: stage 1's instruction counts: the workloads' modules byte for b...eunhhu8 days1-1/+15
* Research 140, 027's stage 1 measured: SHA-256 written in aup (its examples/sh...eunhhu8 days2-0/+70
* Module format: bits and bytes (design 027's stage 1): I64_BITS (and, or, xor,...eunhhu8 days1-0/+6
* Design 027: the computation core inside 026's contract: an app's state one ty...eunhhu8 days1-0/+189
* Research 140: a suite of eleven specs from different fields (DNS, SHA-256, in...eunhhu8 days1-0/+130
* Design 026: the app contract written as mathematics, the part to freeze at 1....eunhhu8 days1-0/+185
* Batch executor: the round's fewest-left marks at the end of Batch: put after ...eunhhu9 days1-0/+16
* Research 139: what a program made at load per batch loop would take (the deci...eunhhu11 days1-2/+49
* 043 programs (research 139, in progress): a batch loop's body as the program ...eunhhu11 days1-0/+52
* Research 138: the batch executor's stage 5, design 025 made: sums into cells ...eunhhu11 days3-4/+86
* Design 025: stage 5's bars measured again on b16: BFS's candidate tail about ...eunhhu11 days1-2/+8
* Design 024: its header says stages 1-4 of 025 are made (134-137)eunhhu12 days1-1/+1
* Research 137: the batch executor's stage 4 (columns read in place, comparison...eunhhu12 days2-1/+70
* Design 025: stage 4's knapsack bar by arithmetic (8.6 ms: two 4 KB copies and...eunhhu12 days1-2/+5
* Research 136: the batch executor's stage 3 (four-byte MUL, reductions with no...eunhhu12 days2-1/+69
* Design 025: stage 3's matmul bar against what the four-byte MUL gave (26.57 m...eunhhu12 days1-2/+3
* Research 135: batch plans' stage 2 measured (b11 = 7959885 against b10, inter...eunhhu12 days2-1/+71
* Design 025: stage 2 reshaped after stage 1 (134): scalar segments planned at ...eunhhu12 days1-10/+22
* Research 134: batch plans' stage 1 measured (b10 = a6fabf0 against b9, interl...eunhhu12 days2-1/+74
* Research 132 and 133 corrected: the per-batch cost was icount's three rounds ...eunhhu12 days2-10/+14
* Design 025: batch programs (132's A), the block's facts once at load and only...eunhhu12 days2-1/+180
* Research 133: register tiles measured (132's deciding experiment): past the b...eunhhu12 days3-2/+90
* Research 132 (no code): where the batch executor's cost sits (an element's pa...eunhhu12 days1-0/+166
* Research 131: the batch executor's general cuts, by the user's choice of the ...eunhhu12 days2-1/+96
* Research 130: the batch executor's frontiers (a count's guard, walks in a bat...eunhhu12 days2-1/+115
* Research 129: the batch executor's costs cut (appends at once 5.18 to 0.65 ms...eunhhu2026-10-062-1/+125
* Research 128: the batch executor's appends, recurrences, sums into cells and ...eunhhu2026-10-063-1/+152
* 024, 126, 127: the lanes are 24 buffers (stage 2), about 200 KB a thread; sta...eunhhu2026-10-053-4/+7
* Research 127: the batch executor's stage 2 (nested loops' rounds run together...eunhhu2026-10-052-1/+66
* Research 126: the batch executor's first stage (024) as built and measured: k...eunhhu2026-10-052-1/+104
* 024: the table with operations apart and interpreted beside the hand-fused fo...eunhhu2026-10-051-34/+36
* Design 024: a batch executor, loops run 256 rounds at a time by operations th...eunhhu2026-10-051-0/+136
* 125: forms and newton runs named; BFS's time after the graph's load is the ge...eunhhu2026-10-052-4/+6
* Research 125: the tier's first steps against C (e2e56dd: roots 1.40, knapsack...eunhhu2026-10-051-0/+80
* Pointer induction (023): an inner count's access by a key affine in its round...eunhhu2026-10-051-0/+8
* 040 forms.c: matmul's inner loop in the forms the tier may make it (index 20....eunhhu2026-10-051-0/+7
* The tier's numbers' arithmetic in a run, each read by the next alone (constan...eunhhu2026-10-051-2/+5
* A HASHED list's table four fifths full at most (100,000 keys in 1 MB of slots...eunhhu2026-10-051-2/+2
* Text keys (023): a list knows the text field it is keyed by; an event's list ...eunhhu2026-10-051-1/+8
* HASHED (023): an event's list keyed by numbers that came out of order keeps e...eunhhu2026-10-051-3/+6
* 023: near C is the aim (each within 1.25x, the geometric mean within 1.1x), n...eunhhu2026-10-051-10/+13
* Research 124: 022's BFS past C only by reading ahead (15.7 ms against 9.9 wit...eunhhu2026-10-051-0/+89
* 023: only checks the tier moved know just that they fail (those left in place...eunhhu2026-10-051-4/+8
* Design 023, before building it: a tier that lifts every block to SSA, knows t...eunhhu2026-10-051-0/+178
* Say what finishing 022's stage 3 found: the books and the work in registers, ...eunhhu2026-10-051-1/+40
* Say what 022 decided while building stages 1-4 and how stage 3 ends: integers...eunhhu2026-10-051-1/+36
* Design 022: stored lists as arrays with a bucket index fitted to the keys sea...eunhhu2026-10-051-0/+151
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 16:20:47 +0000