Used Claude Code to analyze Twitter's algorithm, build FollowSaver Chrome extension, and navigate Web Store submission. AI handled 95% of technical work—I provided direction and created assets. Approved in 24 hours. The barrier to shipping dropped from months to hours.
I've solved the idea-to-code friction by running autonomous AI agents in VMs. Every shower idea gets spec'd and implemented automatically using loop.sh orchestration, specialized subagents, and proper tooling.
Used AI to analyze its own git history, sparking thoughts on transparent AI-human collaboration. The future isn't hiding AI use—it's building verifiable trails of who did what, when, and how. Like Andy Weir's crowdsourced Martian, creative work has always been collaborative.
Built a 4.76M parameter transformer to coordinate 8 bouncer algorithms. While averaging 958 rejections vs RBCR2's 887, achieved breakthrough single game of 855 rejections through learned strategy orchestration.
Each AI coding agent has a niche. Knowing where each one shines is the difference between frustration and flow.
Listen Labs' viral billboard puzzle led to a nightclub bouncer optimization challenge. My AI partner Claude and I spent a day building RBCR (Re-solving Bid-Price with Confidence Reserves), achieving 781 rejections among >30k competitors through dual variables and mathematical optimization.
Complete guide to installing Basecamp's Once Campfire on Oracle Cloud. Covers memory constraints, firewall layers, asset compilation, and SSL configuration for production deployment.
As agents abstract away development like HLLs did assembly, 'human liability for authored code' becomes meaningless. The future is operator liability backed by provable assurance—signed attestations, property tests, and runtime monitoring matter more than keystrokes.
AI agents succeed or fail based on your --help text. Clear command structure, explicit success signals, and structured output options make the difference between one API call and five retries.
Implemented FRE algorithm from Duan et al.'s 2025 paper in production Zig. Achieved O(m log^(2/3) n) complexity for single-source shortest paths, improving on Dijkstra's O(m + n log n). Shows advantage on large sparse graphs by breaking the sorting barrier, but overhead kills performance on small or dense graphs.
Request an AI summary of this blog
