| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Cut what a small record costs a link: no division a record, no walk a delivery | eunhhu | 2026-09-29 | 1 | -19/+35 |
| * | Look for a link's receiver again when its probes go unanswered | eunhhu | 2026-09-29 | 1 | -0/+2 |
| * | Keep a sender's congestion state as one, so an episode undoes it whole | eunhhu | 2026-09-29 | 1 | -54/+51 |
| * | Hold each epoch of a run as one thing: its number, secret and keys | eunhhu | 2026-09-29 | 1 | -127/+112 |
| * | Begin an epoch only from the answer to this offer, not an earlier one | eunhhu | 2026-09-29 | 1 | -7/+12 |
| * | Move a link to a new epoch now and then, so keys that leak later open nothing... | eunhhu | 2026-09-29 | 1 | -39/+414 |
| * | Send no packet only to probe the path or say a challenge back | eunhhu | 2026-09-29 | 1 | -10/+17 |
| * | Close what an attacker on the path could do to a link, each checked | eunhhu | 2026-09-29 | 1 | -28/+113 |
| * | Never let a zero RTT make a link's pace infinite | eunhhu | 2026-09-29 | 1 | -2/+6 |
| * | 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 |
| * | Find how large a packet the path carries: 1,452 bytes once a probe is acknowl... | eunhhu | 2026-09-29 | 1 | -18/+50 |
| * | Send a record in parts cut where a packet is full, not 1000-byte pieces | eunhhu | 2026-09-29 | 1 | -127/+243 |
| * | Wait for late packets, undo what they cost, and grow as CUBIC | eunhhu | 2026-09-29 | 1 | -8/+139 |
| * | Make the load generator's devices real link senders, many on one thread | eunhhu | 2026-09-29 | 1 | -2/+11 |
| * | Keep a link's two sides as state alone, the sockets and threads apart | eunhhu | 2026-09-29 | 1 | -0/+1494 |
