Fe Compiler Architecture and Future Graph Database Vision

The video discusses how compilers often discard rich program representations during lowering. It notes that Fe, an alternative EVM language, uses a query‑based incremental architecture. This architecture provides fast, high‑fidelity tooling such as a language server, code indexing and debug instrumentation. The speaker, Micah Fitch, suggests rethinking compilers as open graph databases that store program representations and their transformations. This approach could enable deeper analysis, safer code reuse and more fluid interfaces for formal verification. The talk is part of the Open & Verifiable Stack track hosted by the Ethereum Foundation.