@yashetal: Growing Boolean circuits never looked cool but now it is
Summary
Alex Mordvintsev introduces MorphoHDL, a minimal language prototype for growing boolean circuits using size-agnostic graph rewrite rules.
View Cached Full Text
Cached at: 07/14/26, 08:20 AM
Growing Boolean circuits never looked cool but now it is
Alex Mordvintsev (@zzznah): Introducing MorphoHDL, a minimal language prototype for growing boolean circuits! https://t.co/3KjDfHTzzy
Early this year I wanted to design a size-agnostic graph rewrite rule system that could build functional boolean circuits. First I thought about “chemistry”-like reactive
Similar Articles
MorphoHDL: A minimalistic language for growing circuits
MorphoHDL is a minimalistic domain-specific language for designing and growing circuits, offering a simple syntax for hardware description.
Self-Organising Digital Circuits
This paper introduces Self-Organising Digital Circuits, using a topology-masked Transformer to configure lookup tables in Boolean gates, enabling circuits to self-assemble and self-repair around hardware faults. It demonstrates near-perfect recovery from soft errors and generalization to larger circuit scales, bridging biological self-organization with digital hardware resilience.
GenCircuit-RL: Reinforcement Learning from Hierarchical Verification for Genetic Circuit Design
GenCircuit-RL introduces a reinforcement learning framework with hierarchical verification rewards for genetic circuit design via code generation, achieving 14-16 percentage point improvement over binary rewards and presenting the SynBio-Reason benchmark of 4,753 circuits.
Chronoformal Closure Theory (CCT) - New mathematical framework: realizability reduces to circuits, minimal observation to hypergraph transversals, and exact state compression may have implications for AI agents
The author releases Chronoformal Closure Theory (CCT), a new mathematical framework showing that problems like realizability, minimal observation, and state compression reduce to finite combinatorial structures, with potential implications for AI agents. The release includes proofs, code, and a partial Lean formalization, inviting independent mathematical scrutiny.
From Combinatorial Mess to Linear Elegance: Architecting a Conversion Engine
A blog post from Minimal detailing how they built a file format conversion engine using an Intermediate Representation to manage complexity linearly, drawing parallels to biological bow-tie architectures.