MorphoHDL: Growing Circuits Recursively
zzznah · x · 2026-07-14
Introducing **MorphoHDL**: a minimal language prototype for "growing circuits." The author initially aimed to build working boolean circuits using **scale-invariant** graph rewriting rules. An early "chemical reaction" concept was abandoned due to the complexity of node types and multi-indexing. The approach shifted to using **cell division** as a structural growth mechanism, treating graph edges as a **bus** rather than single wires, which made recursive construction viable. The post demonstrates how this generates circuits like **ripple-carry adders, Brent–Kung adders, and multipliers**, complete with some "Haeckel-style" graphical demos.
Related event: MorphoHDL: A Minimal Language for Growing Boolean Circuits(2 posts)→
More from Research
- LLM-as-a-Coach turns judge feedback into transferable experiential knowledge — iScienceLuvr · 2026-07-21
- LLM-as-a-Coach turns judge feedback into transferable experiential knowledge — iScienceLuvr · 2026-07-21
- Draft paper uses Markov-chain eigenfunctions to build partitions and speed up sampling — michaelchchoi · 2026-07-21
- Autoresearch proposes packaging ML runs as studies with questions, analysis, and code diffs — morgymcg · 2026-07-21
- GitHub repo adds lightweight ternary QAT for Prism-ML Bonsai models — terminoid_ · 2026-07-21
- Qdrant co-hosts a Munich meetup on search, retrieval, and agentic RAG on July 23 — qdrant_engine · 2026-07-21