aboutsummaryrefslogtreecommitdiffstats
path: root/docs/design
Commit message (Expand)AuthorAgeFilesLines
* Module format and executor: 027's stage 2a: BYTES_SLICE (bytes from a up to b...eunhhu7 days1-3/+8
* Research 140, 027's stage 1 measured: SHA-256 written in aup (its examples/sh...eunhhu7 days1-0/+10
* Module format: bits and bytes (design 027's stage 1): I64_BITS (and, or, xor,...eunhhu7 days1-0/+6
* Design 027: the computation core inside 026's contract: an app's state one ty...eunhhu7 days1-0/+189
* Design 026: the app contract written as mathematics, the part to freeze at 1....eunhhu7 days1-0/+185
* Research 138: the batch executor's stage 5, design 025 made: sums into cells ...eunhhu11 days2-4/+7
* 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 days1-1/+4
* 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 days1-1/+4
* 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 days1-1/+5
* 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 days1-1/+2
* 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 days1-1/+1
* Research 131: the batch executor's general cuts, by the user's choice of the ...eunhhu12 days1-1/+1
* Research 130: the batch executor's frontiers (a count's guard, walks in a bat...eunhhu12 days1-1/+1
* Research 129: the batch executor's costs cut (appends at once 5.18 to 0.65 ms...eunhhu2026-10-061-1/+1
* Research 128: the batch executor's appends, recurrences, sums into cells and ...eunhhu2026-10-062-1/+5
* 024, 126, 127: the lanes are 24 buffers (stage 2), about 200 KB a thread; sta...eunhhu2026-10-051-2/+3
* Research 127: the batch executor's stage 2 (nested loops' rounds run together...eunhhu2026-10-051-1/+1
* Research 126: the batch executor's first stage (024) as built and measured: k...eunhhu2026-10-051-1/+4
* 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-051-1/+1
* 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
* 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
* Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's f...eunhhu2026-10-051-1/+2
* Measure an index for a stored list's slices outside the list: three times a t...eunhhu2026-10-051-3/+8
* Say what a search's floor is with stored lists as trees: 373 ns a node to fin...eunhhu2026-10-051-1/+16
* Say how a search gets past C: event lists as arrays, a directory for stored k...eunhhu2026-10-051-0/+112
* The same answers on the final build and the same pure-runs on the Pi, WSL2 an...eunhhu2026-10-041-2/+3
* Say 020 is built and measured (121, 122)eunhhu2026-10-041-1/+1
* Compute views with a body on view workers, off the connection threads, asked ...eunhhu2026-10-041-0/+11
* Keep one finger a thread, as before: four cost the bank's queries instruction...eunhhu2026-10-041-4/+6
* Search an event's keyed lists by a key set and lists by fingers, add by key i...eunhhu2026-10-041-1/+18
* Say where a search's time goes and how to make it and long views fast, with c...eunhhu2026-10-041-0/+84
* Say what pushing views costs and how fresh it keeps them (019, research 120)eunhhu2026-10-041-1/+1
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 13:59:36 +0000