Weekly CS Paper Digest — 2026-07-19 → 2026-07-25

Weekly Paper Notes — three entries per week: 1 seminal + 2 top picks.

🔁 Seminal Paper of the Week

The Byzantine Generals Problem — Lamport, Shostak & Pease (1982). The paper that named the problem, proved $n \geq 3f + 1$ for oral messages, and showed how signatures lift the bound.

⭐ Top Papers of the Week

OpenForgeRL: Train Harness-native Agents in Any Environment — Xiao Yu, Baolin Peng, Ruize Xu et al. An open-source RL framework that trains agents inside real inference harnesses (Claude Code, Codex, OpenClaw) via a lightweight proxy + Kubernetes rollouts.
Windowed-MTP: Removing the Full-Context Draft-KV Tax at Million-Token Context — Alagappan Valliappan. A training-free, lossless fix for speculative decoding at 1M-token context: sliding-window the MTP draft head only. 28–44% per-step speedup.

The full Slack digest covered roughly a dozen more papers across AI/ML, NLP, distributed computing, databases, OS, networking, and PL that were deliberately not expanded into blog notes. Only the highest-impact picks — plus one rotating seminal classic — become long-form posts.

OpenForgeRL: Train Harness-native Agents in Any Environment

Weekly Paper Notes — one of the top picks from the 2026-07-25 CS paper digest. Area: AI / ML (Agent Training). Authors: Xiao Yu, Baolin Peng, Ruize Xu et al. arXiv: 2607.21557 · PDF TL;DR Modern agents are shaped less by their base model and more by the harness wrapped around it — Claude Code, Codex, OpenClaw, GUI-use scaffolds. But those harnesses are stateful, multi-process, and full of tool orchestration, which means existing open SFT/RL stacks (veRL, TRL, OpenRLHF) can’t natively express a rollout inside one....

Byzantine Generals — why 3 nodes cannot tolerate 1 traitor

The Byzantine Generals Problem (Lamport, Shostak & Pease, 1982)

Weekly Paper Notes — 🔁 Seminal Paper of the Week for the 2026-07-25 CS paper digest. Area: Distributed Computing. Authors: Leslie Lamport, Robert Shostak, Marshall Pease (SRI International) Venue: ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3, July 1982, pp. 382–401. DOI: 10.1145/357172.357176 · PDF (SRI copy) Why the paper still matters Almost every distributed system in production today — Spanner, etcd, ZooKeeper, Kafka, every blockchain, every consensus protocol with a Greek letter in its name — is a descendant of the impossibility and possibility results in this 20-page paper....

Windowed-MTP: Removing the Full-Context Draft-KV Tax at Million-Token Context

Weekly Paper Notes — one of the top picks from the 2026-07-25 CS paper digest. Area: NLP / LLM Inference. Author: Alagappan Valliappan arXiv: 2607.21535 · PDF TL;DR Frontier LLMs increasingly ship a built-in Multi-Token-Prediction (MTP / NEXTN) draft head for speculative decoding, based on the assumption that the draft is negligibly cheap. Windowed-MTP shows that assumption breaks catastrophically at million-token context: the native MTP head does full attention over the entire KV cache at every draft step, so its cost grows linearly with context and comes to dominate — precisely where speculation is supposed to matter most....

Aurora DSQL: Scalable, Multi-Region OLTP

arXiv: 2607.13276 · PDF: 2607.13276.pdf Authors: Marc Brooker, Marc Bowes, et al. (Amazon Web Services) TL;DR Aurora DSQL is AWS’s new serverless, PostgreSQL-compatible OLTP database designed for multi-region active-active writes. The architecture disaggregates compute (Firecracker MicroVMs running stateless SQL), storage, and transaction coordination into independent horizontally-scalable services. It uses MVCC with precision timestamps for coordination-free reads and optimistic concurrency control for writes, deferring all coordination to commit time via distributed adjudicators and a Journal replication tier....

Paxos Made Simple — Seminal Paper of the Week

Original: Leslie Lamport, Paxos Made Simple, ACM SIGACT News 32(4), December 2001. Canonical PDF: lamport.azurewebsites.net/pubs/paxos-simple.pdf Predecessor: The Part-Time Parliament, ACM TOCS 16(2), 1998 (the “island of Paxos” allegory that nobody could read). Why “made simple” Lamport originally described his consensus algorithm in 1998 in The Part-Time Parliament, a paper framed as archaeological reconstruction of the parliamentary procedures of an ancient Greek island. It was a joke. It was also, by broad consensus (pun deliberate), unreadable — reviewers hated it, adoption was near zero for years, and even engineers who wanted to build on it complained they couldn’t....

Pretraining Data Can Be Poisoned through Computational Propaganda

arXiv: 2607.15267 · PDF: 2607.15267.pdf Authors: Victoria Graf, Hannaneh Hajishirzi, et al. TL;DR Prior work on pretraining-data poisoning has mostly targeted curated sources like Wikipedia — a poor stand-in for the scale and heterogeneity of real pretraining corpora. This paper demonstrates that public discussion interfaces on the open web (comment sections, forums, Q&A pages) are a viable at-scale injection vector, and introduces HalfLife, an analysis technique for estimating whether adversarial content actually survives web-crawl-based data curation pipelines and lands in the training set....

Super Weights in LLMs and the Failure of Selective Training

Weekly Paper Notes — one of the top picks from the 2026-07-11 CS paper digest. Area: AI / ML. Authors: Shreyas Subramanian, Adewale Akinfaderin, Akarsha Sehwag (Amazon) arXiv: 2607.08733 · PDF TL;DR “Super Weights” — individual scalar parameters in a large language model whose removal collapses task accuracy — were the interpretability finding of 2024–2025. The natural inference was that if these coordinates matter that much for the forward pass, they should also matter that much for learning: freeze everything else, train only the Super Weights (or a small neighbourhood around them), and you should get parameter-efficient fine-tuning for essentially free....

The Chubby Lock Service for Loosely-Coupled Distributed Systems

Weekly Paper Notes — Seminal Paper of the Week for the 2026-07-11 CS paper digest. Area: Distributed Computing / Coordination. Author: Mike Burrows (Google) Venue: OSDI ‘06 — The Chubby lock service for loosely-coupled distributed systems Canonical link: OSDI ‘06 proceedings · PDF Why the paper still matters Twenty years after publication, Chubby is the paper you can point at to explain almost every coordination system in the modern datacenter....

Who Needs DRAM? We Have Fiber

Weekly Paper Notes — one of the top picks from the 2026-07-11 CS paper digest. Area: Distributed Computing / Systems. Authors: Hannah Atmer, Thiemo Voigt, Yuan Yao, Stefanos Kaxiras (Uppsala University) arXiv: 2607.08407 · PDF TL;DR DRAM is the choke point of the current generative-AI buildout. HBM3e stacks are backordered, contract prices are up, and hyperscalers are absorbing a large fraction of global DRAM output just to fan the same model weights out to ever more accelerators....

Cadence: Extreme Pipelining with Multiple Concurrent Proposers

arXiv: 2607.02275 · PDF: pdf · Published: 2026-07-02 TL;DR Cadence is a Byzantine fault-tolerant consensus protocol that finalizes blocks at arbitrarily low block intervals by running each slot as an independent consensus instance — no slot waits for its predecessor to finish or propagate. It also drops the single-leader model in favor of multiple concurrent proposers (MCP) per slot, giving short-term censorship resistance and “hiding” (a proposer can’t craft its proposal in reaction to others’)....

🔁 Seminal Paper of the Week#

⭐ Top Papers of the Week#

🔁 Seminal Paper of the Week

⭐ Top Papers of the Week