weekly-papers-2026-07

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....

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....

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....

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’)....

arXiv: 2607.02401 · PDF: pdf · Published: 2026-07-02 TL;DR NVM key-value stores have gotten fast at ingest and point lookup, but they’ve skipped the interface guarantees a real database engine needs: point-in-time snapshots, consistent iterators, and atomic batches. FlintKV is an NVM-optimized, skiplist-based engine that natively supports all three under durable linearizability, using a novel flat-combining multi-version concurrency control algorithm co-designed with its persistence path. Standalone it beats prior work by up to 75% in end-to-end throughput; its durable skiplist can also be dropped into existing NVM stores as a component upgrade....

Paper: Spanner: Google’s Globally-Distributed Database, Corbett et al., OSDI 2012. Canonical URL: research.google/pubs/pub39966 Every week we spotlight a foundational paper that still shapes how systems are built. This week — as the digest surfaces new BFT consensus (Cadence) and NVM storage (FlintKV) work — we rotate to databases and revisit the paper that arguably did the most to reset the industry’s assumptions about what a distributed OLTP system can offer: Spanner....