2000 parallel agents built a browser; strict time beats monotonic
Today's insights explore how massive parallelization and precise abstractions can unlock new engineering possibilities. From coordinating thousands of AI agents to designing bulletproof time systems, these approaches reveal overlooked optimization opportunities.
• Massive agent coordination works through smart task decomposition: Cursor's FastRender project ran 2,000 AI agents concurrently across multiple machines (300 per machine), generating thousands of commits per hour with minimal merge conflicts. The key breakthrough was using planning agents to divide work into non-overlapping chunks, enabling true parallel development at unprecedented scale.
• Visual feedback loops and rigid compilers enable autonomous coding: The agents worked autonomously for up to a week without human intervention, using GPT-5.2's vision capabilities to compare browser rendering screenshots against expected outputs, while Rust's strict compiler provided continuous verification. Interestingly, general models (GPT-5.1/5.2) outperformed specialized coding models for complex autonomous tasks.
• Strictly monotonic time eliminates subtle concurrency bugs: Instead of standard monotonic time that allows equal timestamps, adding just +1 nanosecond to each reading makes duplicate timestamps impossible. This simple change transforms loose assertions like assert(past <= present) into strict ones like assert(past < present), catching bugs where the same timestamp instance is incorrectly reused.
2 articles published
Articles
Considering Strictly Monotonic Time
Considering Strictly Monotonic Time Jan 23, 2026 Monotonic time is a frequently used, load bearing abstraction. Monotonicity is often enforced using the following code: fn now(clock: *Clock) Instant