| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| ... | |
| * | Research 128: the batch executor's appends, recurrences, sums into cells and ... | eunhhu | 2026-10-06 | 2 | -1/+5 |
| * | 024, 126, 127: the lanes are 24 buffers (stage 2), about 200 KB a thread; sta... | eunhhu | 2026-10-05 | 1 | -2/+3 |
| * | Research 127: the batch executor's stage 2 (nested loops' rounds run together... | eunhhu | 2026-10-05 | 1 | -1/+1 |
| * | Research 126: the batch executor's first stage (024) as built and measured: k... | eunhhu | 2026-10-05 | 1 | -1/+4 |
| * | 024: the table with operations apart and interpreted beside the hand-fused fo... | eunhhu | 2026-10-05 | 1 | -34/+36 |
| * | Design 024: a batch executor, loops run 256 rounds at a time by operations th... | eunhhu | 2026-10-05 | 1 | -0/+136 |
| * | 125: forms and newton runs named; BFS's time after the graph's load is the ge... | eunhhu | 2026-10-05 | 1 | -1/+1 |
| * | Pointer induction (023): an inner count's access by a key affine in its round... | eunhhu | 2026-10-05 | 1 | -0/+8 |
| * | 040 forms.c: matmul's inner loop in the forms the tier may make it (index 20.... | eunhhu | 2026-10-05 | 1 | -0/+7 |
| * | The tier's numbers' arithmetic in a run, each read by the next alone (constan... | eunhhu | 2026-10-05 | 1 | -2/+5 |
| * | A HASHED list's table four fifths full at most (100,000 keys in 1 MB of slots... | eunhhu | 2026-10-05 | 1 | -2/+2 |
| * | Text keys (023): a list knows the text field it is keyed by; an event's list ... | eunhhu | 2026-10-05 | 1 | -1/+8 |
| * | HASHED (023): an event's list keyed by numbers that came out of order keeps e... | eunhhu | 2026-10-05 | 1 | -3/+6 |
| * | 023: near C is the aim (each within 1.25x, the geometric mean within 1.1x), n... | eunhhu | 2026-10-05 | 1 | -10/+13 |
| * | 023: only checks the tier moved know just that they fail (those left in place... | eunhhu | 2026-10-05 | 1 | -4/+8 |
| * | Design 023, before building it: a tier that lifts every block to SSA, knows t... | eunhhu | 2026-10-05 | 1 | -0/+178 |
| * | Say what finishing 022's stage 3 found: the books and the work in registers, ... | eunhhu | 2026-10-05 | 1 | -1/+40 |
| * | Say what 022 decided while building stages 1-4 and how stage 3 ends: integers... | eunhhu | 2026-10-05 | 1 | -1/+36 |
| * | Design 022: stored lists as arrays with a bucket index fitted to the keys sea... | eunhhu | 2026-10-05 | 1 | -0/+151 |
| * | Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's f... | eunhhu | 2026-10-05 | 1 | -1/+2 |
| * | Measure an index for a stored list's slices outside the list: three times a t... | eunhhu | 2026-10-05 | 1 | -3/+8 |
| * | Say what a search's floor is with stored lists as trees: 373 ns a node to fin... | eunhhu | 2026-10-05 | 1 | -1/+16 |
| * | Say how a search gets past C: event lists as arrays, a directory for stored k... | eunhhu | 2026-10-05 | 1 | -0/+112 |
| * | The same answers on the final build and the same pure-runs on the Pi, WSL2 an... | eunhhu | 2026-10-04 | 1 | -2/+3 |
| * | Say 020 is built and measured (121, 122) | eunhhu | 2026-10-04 | 1 | -1/+1 |
| * | Compute views with a body on view workers, off the connection threads, asked ... | eunhhu | 2026-10-04 | 1 | -0/+11 |
| * | Keep one finger a thread, as before: four cost the bank's queries instruction... | eunhhu | 2026-10-04 | 1 | -4/+6 |
| * | Search an event's keyed lists by a key set and lists by fingers, add by key i... | eunhhu | 2026-10-04 | 1 | -1/+18 |
| * | Say where a search's time goes and how to make it and long views fast, with c... | eunhhu | 2026-10-04 | 1 | -0/+84 |
| * | Say what pushing views costs and how fresh it keeps them (019, research 120) | eunhhu | 2026-10-04 | 1 | -1/+1 |
| * | Push a view's value to its subscribers over SSE, once per group and interval ... | eunhhu | 2026-10-04 | 2 | -1/+10 |
| * | Fix 019 before building: compare equal freshness, bound pushes per interval, ... | eunhhu | 2026-10-04 | 1 | -9/+24 |
| * | Say how pure-serve pushes a view's value to its subscribers, and what it must... | eunhhu | 2026-10-04 | 1 | -0/+91 |
| * | Say what views that compute cost the writes beside them (018 stage 3, researc... | eunhhu | 2026-10-04 | 1 | -1/+2 |
| * | Say why stage 3's first isolation criterion could not hold, and what to measu... | eunhhu | 2026-10-04 | 1 | -0/+21 |
| * | Let a view compute in its body, on a reader's own lists (018 stage 3) | eunhhu | 2026-10-04 | 2 | -5/+16 |
| * | Say what computing in one event costs and finds (018 stage 2, research 118) | eunhhu | 2026-10-04 | 1 | -1/+2 |
| * | Count in loops that nest, break, and keep an event's own lists, every event b... | eunhhu | 2026-10-04 | 2 | -10/+30 |
| * | Say what a transient state saves a write (018 stage 1, research 117) | eunhhu | 2026-10-04 | 1 | -1/+2 |
| * | Keep transient states the app's while it runs, never stored (018 stage 1) | eunhhu | 2026-10-04 | 2 | -5/+13 |
| * | Say how aup chooses what a state outlives, and computes in memory (018) | eunhhu | 2026-10-04 | 1 | -0/+199 |
| * | Say what an app's tokens cost (017 3b, research 116) | eunhhu | 2026-10-04 | 1 | -1/+9 |
| * | Say how an app's routes take tokens, and what it must show (017, 3b) | eunhhu | 2026-10-04 | 1 | -1/+30 |
| * | Say that reading the code found stage 3's two races, and how a host changes apps | eunhhu | 2026-10-04 | 1 | -2/+2 |
| * | Say what apps that change on a running host showed (017 stage 3, research 115) | eunhhu | 2026-10-04 | 1 | -6/+24 |
| * | Say how apps start, stop and change on a running host, and what it must show ... | eunhhu | 2026-10-04 | 1 | -1/+76 |
| * | Say what one sending loop showed (017 2b, research 113) | eunhhu | 2026-10-01 | 1 | -6/+22 |
| * | Say how sends will share one loop, and what it must show (017, 2b) | eunhhu | 2026-10-01 | 1 | -3/+18 |
| * | Say that apps of a host send to each other and to other nodes (017) | eunhhu | 2026-10-01 | 1 | -2/+13 |
| * | docs: link aup and vega via clean web paths instead of raw server paths | eunhhu | 2026-10-01 | 1 | -1/+1 |
