The Register columnist Corey Quinn demonstrates that DNS can be repurposed as a database, and that a database can in turn be made to act like a computer. His build stores arithmetic and logic results as DNS records, with a small external program providing the clock and wiring that DNS lacks. The result is a 32-bit machine that runs Doom, albeit by carrying out memory reads, writes, and instruction lookups entirely through DNS queries.
Under the hood, the machine uses 6.4 million DNS records holding truth tables. Each update is an RFC 2136 DNS UPDATE that only succeeds if the previous stored state still matches what was last written, a pattern the column describes as optimistic concurrency. BIND answers queries in single-digit microseconds, but a single frame requires about 6.6 million lookups. Quinn's initial test pressed right and waited 577 seconds for a result; after optimizations such as UDP transport, denser register packing, and fewer lookups per instruction, the time dropped to 54.4 seconds.
That still works out to roughly 54,000 milliseconds per tick, while Doom's tick rate is 35 per second, or about 28.6 milliseconds per tick. The project is verifiable, with each rendered frame checked against an independent emulator, and it runs on stock Debian BIND 9.20. Quinn reports that DNS pioneer Paul Vixie called it the best use of RFC 2136 DNS UPDATE he had ever seen. Since the article is a single first-person column, there are no conflicting sources or disagreements to compare. Latent Digest. The text generated is original, not copied from source. Need maybe