Auto-Arch Tournament vs SMF (Semantic Memory Filesystem)

Auto-Arch Tournament is an autonomous research system where an AI agent iteratively proposes, implements, and validates microarchitectural improvements to a RISC-V CPU. Starting from a standard 5-stage pipeline, the loop runs hypotheses in parallel, each going through formal verification (53 symbolic checks), cycle-accurate simulation, multi-seed FPGA place-and-route, and CoreMark CRC validation. Only hypotheses that beat the current champion get merged; everything else gets discarded. Starting from 301 iterations/second, the system hit 577 iter/s (+92%) across 73 attempts in 9.8 hours — producing a design 26% faster and 40% smaller in LUTs than the baseline. The insight the author drives home is that the real innovation isn't the AI agent — it's the verifier. The orchestrator is hardcoded to prevent agents from manipulating their own evaluation gates, a simple but critical design constraint that turns a creative process into a trustworthy one. Without a rigorous verification harness, agent-driven optimization becomes a confidence trick. This is early but fascinating proof that AI-driven hardware design loops can produce commercially meaningful gains. The repo uses Claude Code or Codex as the coding agent, SystemVerilog for the RTL, and standard open-source EDA tooling (Yosys, nextpnr, Verilator). It's a compelling template for anyone building agentic optimization loops where correctness matters.

SMF (Semantic Memory Filesystem) is an open-source Python library that treats the POSIX filesystem as the native memory infrastructure for AI agents. The core bet: instead of standing up a vector database, embedding service, and retrieval pipeline, you model your agent's memory as ordinary directories, files, and symlinks — then use the OS's own tools for retrieval. Entities are directories, relationships are symlinks, metadata is file attributes, and search is built on grep and find. The appeal is radical simplicity. Every developer already understands the filesystem. Memory built on top of it is inspectable with any editor, versionable with git, and portable across machines with rsync. There's no new query language to learn, no vector index to maintain, and no external service to keep running. Dynamis-Labs argues that for many agent memory use cases, semantic similarity search is overkill — you need entity graphs and efficient lookup, which the filesystem already provides. With only 7 stars and created yesterday (April 14), SMF is in very early stages. But the approach has attracted immediate discussion from developers frustrated with the operational overhead of vector databases for relatively structured memory tasks. It's a contrarian bet that's worth watching.