| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Never let a zero RTT make a link's pace infinite | eunhhu | 2026-09-29 | 1 | -2/+6 |
| * | Measure a link on paths of loss, reordering and a bottleneck, against quinn (... | eunhhu | 2026-09-29 | 4 | -1/+344 |
| * | Let M6's path waver by 1 ms when flows share it, and count from 20 s of 60 | eunhhu | 2026-09-29 | 1 | -6/+9 |
| * | Keep Reno's pace at 0.53 datagrams an RTT, as deployed CUBIC does | eunhhu | 2026-09-29 | 1 | -6/+8 |
| * | Pace a link's packets, and keep Reno's pace by time as well as by acknowledgm... | eunhhu | 2026-09-29 | 1 | -0/+30 |
| * | Record one round of M6 with the path's MTU found, before pacing (020) | eunhhu | 2026-09-29 | 1 | -0/+42 |
| * | Let the M6 simulator queue records at a rate and time each one | eunhhu | 2026-09-29 | 1 | -5/+33 |
| * | Start M6's flows together, each a process, and count their shares from 10 s | eunhhu | 2026-09-29 | 1 | -26/+63 |
| * | Find how large a packet the path carries: 1,452 bytes once a probe is acknowl... | eunhhu | 2026-09-29 | 6 | -44/+118 |
| * | Record M6 with records in parts and no path MTU yet (020) | eunhhu | 2026-09-29 | 1 | -0/+126 |
| * | Queue only the way to the receivers behind M6's bottleneck | eunhhu | 2026-09-29 | 2 | -18/+30 |
| * | Send a record in parts cut where a packet is full, not 1000-byte pieces | eunhhu | 2026-09-29 | 2 | -129/+246 |
| * | Apply a link's records in transport.c as a host does | eunhhu | 2026-09-29 | 1 | -11/+20 |
| * | Measure a link on a path of loss, reordering and a bottleneck (M6 harness) | eunhhu | 2026-09-29 | 5 | -33/+382 |
| * | Wait for late packets, undo what they cost, and grow as CUBIC | eunhhu | 2026-09-29 | 4 | -13/+311 |
| * | Say why the links became a part, and not a repository (009, 011) | eunhhu | 2026-09-29 | 2 | -3/+38 |
| * | Make the load generator's devices real link senders, many on one thread | eunhhu | 2026-09-29 | 4 | -384/+170 |
| * | Keep a link's two sides as state alone, the sockets and threads apart | eunhhu | 2026-09-29 | 8 | -1555/+2054 |
| * | Let links know nothing of the core: the host names inputs and shapes | eunhhu | 2026-09-29 | 7 | -105/+137 |
| * | Put the links and the crypto they use in link/, a part of their own | eunhhu | 2026-09-29 | 16 | -35/+47 |
| * | Measure the drains again with the outbox as a list (096) | eunhhu | 2026-09-29 | 2 | -17/+48 |
| * | Keep the outbox as a list: a save logs only the sends and trims it made | eunhhu | 2026-09-29 | 7 | -153/+277 |
| * | Measure the CPU a record costs a link, against quinn (096) | eunhhu | 2026-09-29 | 6 | -22/+395 |
| * | Send a record whole when it fits a packet, however many pieces it has | eunhhu | 2026-09-29 | 3 | -46/+75 |
| * | Keep a link's queued records in one byte ring, taken back as they are stored | eunhhu | 2026-09-28 | 1 | -23/+65 |
| * | Keep a stream's records in order on a line, handed over as they are | eunhhu | 2026-09-28 | 1 | -13/+93 |
| * | Take a burst whole with UDP GRO; key the listener's AES only when the run cha... | eunhhu | 2026-09-28 | 1 | -11/+63 |
| * | Send small records in a RECORDS frame: 1 or 2 bytes of framing each, not 19 | eunhhu | 2026-09-28 | 2 | -9/+74 |
| * | Wake a link's thread only when it sleeps, once | eunhhu | 2026-09-28 | 2 | -3/+178 |
| * | Drain a link's backlog without scanning it: 370k to 990k records a second | eunhhu | 2026-09-28 | 1 | -105/+218 |
| * | Measure a restart under load and a first contact (095) | eunhhu | 2026-09-28 | 9 | -30/+341 |
| * | Name the link threads, so their CPU is seen apart (pure-link, pure-listen) | eunhhu | 2026-09-28 | 1 | -0/+2 |
| * | Remember each sender's secret beside the node's key: no X25519 at restart | eunhhu | 2026-09-28 | 4 | -10/+89 |
| * | Measure a link at rest: 132 bytes against a QUIC connection's 38,106 (094) | eunhhu | 2026-09-28 | 10 | -1/+2123 |
| * | Keep a run's keys as bytes: one AES-GCM context serves the listener | eunhhu | 2026-09-28 | 5 | -66/+100 |
| * | Let a link at rest cost the listener only its allowing | eunhhu | 2026-09-28 | 4 | -172/+433 |
| * | Keep the numbers heard as a list: a save logs only the ones it changed | eunhhu | 2026-09-28 | 5 | -123/+290 |
| * | Link two nodes without a connection over UDP (093, design 011's first stage) | eunhhu | 2026-09-28 | 13 | -26/+1890 |
| * | 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 |
| * | Measure TPC-C again with compact log records | eunhhu | 2026-09-28 | 5 | -34/+39 |
| * | Log list changes compact: varint positions and integers, the rest bit for bit | eunhhu | 2026-09-28 | 4 | -32/+131 |
| * | Check TPC-C's consistency from one snapshot a side, and measure TPC-C on RAM ... | eunhhu | 2026-09-28 | 6 | -24/+235 |
| * | Write list images a chunk at a time, and keep the log within the lists' size | eunhhu | 2026-09-28 | 6 | -37/+116 |
| * | Keep lists as images and a log of their changes, checkpointed off the owner | eunhhu | 2026-09-28 | 10 | -188/+662 |
| * | Log an app's saves in reused segments and write list images whole beside the ... | eunhhu | 2026-09-28 | 5 | -4/+862 |
| * | Share the store's digest between its files | eunhhu | 2026-09-28 | 3 | -71/+81 |
| * | Gather returning requests only as long as the last save waited for its device | eunhhu | 2026-09-28 | 1 | -3/+18 |
| * | Read and write numbers exactly without strtod or printf in the common cases | eunhhu | 2026-09-28 | 5 | -2/+172 |
| * | Guide a list's inner nodes: items before each child and its first key, search... | eunhhu | 2026-09-28 | 4 | -44/+197 |
