| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | 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 |
| * | Say how apps will send to each other and to other nodes, and what it must sho... | eunhhu | 2026-10-01 | 1 | -2/+41 |
| * | Say that one host runs many apps, and what its first stage found (017) | eunhhu | 2026-10-01 | 1 | -10/+41 |
| * | Say how one host will run many apps, and what it must show (017) | eunhhu | 2026-10-01 | 1 | -0/+128 |
| * | Say that i64 is in, and what it found (016) | eunhhu | 2026-09-30 | 1 | -1/+26 |
| * | Pin an i64's meaning on every path (015) | eunhhu | 2026-09-30 | 1 | -5/+27 |
| * | Give i64 its own type in modules, lists, stores and the host (016 stage 2) | eunhhu | 2026-09-30 | 1 | -7/+18 |
| * | Say how i64 will be built, and what it must not slow down (016) | eunhhu | 2026-09-30 | 1 | -13/+58 |
| * | Say that bool is in, and what its first stage found (016) | eunhhu | 2026-09-30 | 1 | -1/+19 |
| * | Check a bool view's text and a bool argument over HTTP | eunhhu | 2026-09-30 | 1 | -0/+1 |
| * | Pin a bool's meaning on every path (015) | eunhhu | 2026-09-30 | 1 | -4/+20 |
| * | Give bools their own type in the module format (v6, 016 stage 1) | eunhhu | 2026-09-30 | 2 | -46/+53 |
| * | Say what bool and i64 mean at every boundary, before building them (016) | eunhhu | 2026-09-30 | 1 | -0/+74 |
| * | Say what the screen showed of a value, and what Vega now keeps from acting (0... | eunhhu | 2026-09-30 | 1 | -1/+13 |
| * | Say what a value means at each boundary, and what checking it found (015, 108) | eunhhu | 2026-09-30 | 1 | -0/+70 |
| * | Say what laying a record out anew costs (014) | eunhhu | 2026-09-30 | 1 | -1/+1 |
| * | Take a delivery's fields by name, dropping none | eunhhu | 2026-09-30 | 2 | -4/+93 |
| * | Say what the windows and checkpoints cost (013 steps 2 and 3, 104) | eunhhu | 2026-09-30 | 1 | -6/+16 |
| * | Say where a node's memory goes, and the budget it now keeps (104, 013) | eunhhu | 2026-09-30 | 2 | -0/+99 |
| * | Let a receiver whose app is full keep what came, and say so | eunhhu | 2026-09-30 | 1 | -3/+8 |
| * | Say what adopting the link took, and how it fares against ngtcp2 (102) | eunhhu | 2026-09-29 | 2 | -18/+33 |
| * | Size a receiver's credit by what it holds, not 1,024 records | eunhhu | 2026-09-29 | 1 | -3/+7 |
| * | Remember the epoch of each of a peer's runs that send, not one | eunhhu | 2026-09-29 | 1 | -4/+11 |
| * | Specify the link (012) and make it the default between nodes (011) | eunhhu | 2026-09-29 | 4 | -4/+351 |
| * | Say how the four limits left went: three solved, one measured away (101) | eunhhu | 2026-09-29 | 1 | -0/+7 |
| * | Say that a receiver moved to another machine is followed, and how (100) | eunhhu | 2026-09-29 | 1 | -0/+5 |
| * | Say what epochs cost a link, and what the search for it found (099) | eunhhu | 2026-09-29 | 1 | -1/+6 |
| * | Say what an attacker on the path could do to a link, and what now stops it (098) | eunhhu | 2026-09-29 | 1 | -0/+5 |
| * | Measure a link on paths of loss, reordering and a bottleneck, against quinn (... | eunhhu | 2026-09-29 | 1 | -1/+6 |
| * | Say why the links became a part, and not a repository (009, 011) | eunhhu | 2026-09-29 | 2 | -3/+38 |
| * | Measure the CPU a record costs a link, against quinn (096) | eunhhu | 2026-09-29 | 1 | -1/+6 |
| * | Measure a restart under load and a first contact (095) | eunhhu | 2026-09-28 | 1 | -3/+7 |
| * | Measure a link at rest: 132 bytes against a QUIC connection's 38,106 (094) | eunhhu | 2026-09-28 | 1 | -1/+6 |
| * | Link two nodes without a connection over UDP (093, design 011's first stage) | eunhhu | 2026-09-28 | 1 | -1/+6 |
| * | Redesign 011: no connections, the transport's state as the app's data | eunhhu | 2026-09-28 | 2 | -151/+172 |
| * | Design the Pure transport: stored records sent straight over UDP (011) | eunhhu | 2026-09-28 | 2 | -0/+202 |
| * | Log list changes compact: varint positions and integers, the rest bit for bit | eunhhu | 2026-09-28 | 1 | -2/+4 |
| * | Keep lists as images and a log of their changes, checkpointed off the owner | eunhhu | 2026-09-28 | 1 | -4/+24 |
| * | Save a list as its items and a journal of its changes since | eunhhu | 2026-09-28 | 1 | -2/+2 |
