CompilersLogic Programming with Differential EquationsWe explore differential equations as a surprisingly flexible form of computation. We explore ODEs capable of encoding and solving complex logic problems, unlocking potentially efficient ways to approach tasks like graph coloring and prime factorization.
Distributed SystemsAbstract Intent MachinesAs part of our ongoing research into intents, we've formulated what we believe to be a minimal framework for describing intent processing. In this post, we introduce the concept of an "intent machine", entities capable of processing user intents and transforming system state accordingly.
CompilersUnderstanding and Arithmetizing Hylomorphism TracesThis short post is intended to summarize some work on a simple exercise that may be useful to keep in mind when arithmetizing purely functional programs.
Distributed SystemsFormalizing Concurrent Programs; The GeneralitiesIn this post, I want to describe the general idea of formalizing concurrent programs, some different approaches, and some connections to more abstract mathematics.
CompilersArithmetizing Computable Programs SimplyWe discuss different ways of encoding computable functions, describing nuances and limitations, before ending on the simplest known method using an intentionally complete operation that's simpler and easier to use than a Turing machine.
CompilersThe Unrealized Potential of String Diagrams for ZKVMsTrees for formal syntax have myriad deficiencies which can be overcome by string diagrams. How string diagrams fix trees also makes them well suited for arithmetization into universal circuits, which can be viewed as ZKVMs for domains that go beyond mere program execution.
