Find Shiny Pokémon! Find Shiny Pokémon! Find Shiny Pokémon! > Here's a timelapse of 1,000 computers running Pokémon Silver. Each computer runs until a Pokémon is encountered and the model checks if the Pokémon is shiny or not. The computers programmatically forks from a saved snapshot and run until a shiny Pokémon is found (1/8192 chance). > We built a custom hypervisor (in Rust) and a distributed filesystem with content deduplication to support massive scale (1M+ concurrent VMs) with zero interruption to the live process. We capture the full state of the computer: in process actions, live applications, filesystem, and memory. > Agents in tools like CAD or Photoshop can't replay their way to a result. Every run is different. Instead, snapshot the VM at each successful state and run parallel attempts to produce dramatically better outcomes. Without snapshotting, the agent restarts from scratch every time. > @fastestvm is building new computer infrastructure to enable novel research and inference paradigms for AI research and agent startups.(Albert Su)