<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://www.philipzucker.com/feed.xml" rel="self" type="application/atom+xml" /><link href="https://www.philipzucker.com/" rel="alternate" type="text/html" /><updated>2026-03-27T15:00:04+00:00</updated><id>https://www.philipzucker.com/feed.xml</id><title type="html">Hey There Buddo!</title><subtitle>A blog about life, programming, math, logic, and physics.</subtitle><entry><title type="html">Alpha Equivalent Hash Consing with Thinnings</title><link href="https://www.philipzucker.com/thin_hash_cons_codebruijn/" rel="alternate" type="text/html" title="Alpha Equivalent Hash Consing with Thinnings" /><published>2026-03-26T00:00:00+00:00</published><updated>2026-03-26T00:00:00+00:00</updated><id>https://www.philipzucker.com/thin_hash_cons_codebruijn</id><author><name></name></author><summary type="html"><![CDATA[Another step on a journey to a thinning egraph.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Monus, Factor, and Thinning Union Finds</title><link href="https://www.philipzucker.com/thin_monus_uf/" rel="alternate" type="text/html" title="Monus, Factor, and Thinning Union Finds" /><published>2026-03-14T00:00:00+00:00</published><updated>2026-03-14T00:00:00+00:00</updated><id>https://www.philipzucker.com/thin_monus_uf</id><author><name></name></author><summary type="html"><![CDATA[I have kind of a recipe book I follow to thinking about generalized e-graphs or e-graph modulo theories. One recipe is to try and swap a regular union find out with some notion of generalized union find.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Refinement Modeling and Verification of RISC-V Assembly using Knuckledragger</title><link href="https://www.philipzucker.com/refine_assembly/" rel="alternate" type="text/html" title="Refinement Modeling and Verification of RISC-V Assembly using Knuckledragger" /><published>2026-03-10T00:00:00+00:00</published><updated>2026-03-10T00:00:00+00:00</updated><id>https://www.philipzucker.com/refine_assembly</id><author><name></name></author><summary type="html"><![CDATA[Binary verification is useful on a couple counts:]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Thinnings: Sublist Witnesses and de Bruijn Index Shift Clumping</title><link href="https://www.philipzucker.com/thin1/" rel="alternate" type="text/html" title="Thinnings: Sublist Witnesses and de Bruijn Index Shift Clumping" /><published>2026-03-08T00:00:00+00:00</published><updated>2026-03-08T00:00:00+00:00</updated><id>https://www.philipzucker.com/thin1</id><author><name></name></author><summary type="html"><![CDATA[There was a thread on mastodon recently where Conor Mcbride was discussing some really cool stuff. I think the intent was to get at something more interesting, but this is the first place I’ve seen thinnings explained in a way without too many complex trappings around and it really clicked with me. I think I had a primed mind to see something useful to my current set of problems and solutions there. It unlocked a torrent of ideas related to lambda egraphs and generalized unions finds that I’m quite excited to talk about in the next couple posts.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">State of Knuckledragger III: Kernel Changes, Symbolic Union, AI, and more</title><link href="https://www.philipzucker.com/state_o_knuck_3/" rel="alternate" type="text/html" title="State of Knuckledragger III: Kernel Changes, Symbolic Union, AI, and more" /><published>2026-03-02T00:00:00+00:00</published><updated>2026-03-02T00:00:00+00:00</updated><id>https://www.philipzucker.com/state_o_knuck_3</id><author><name></name></author><summary type="html"><![CDATA[Maybe a good idea to take stock of how Knuckledragger https://github.com/philzook58/knuckledragger is going for myself and whomever might be interested.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">An Associative-Commutative (AC) Hash Cons with AC matching</title><link href="https://www.philipzucker.com/ac_hashcons/" rel="alternate" type="text/html" title="An Associative-Commutative (AC) Hash Cons with AC matching" /><published>2026-02-22T00:00:00+00:00</published><updated>2026-02-22T00:00:00+00:00</updated><id>https://www.philipzucker.com/ac_hashcons</id><author><name></name></author><summary type="html"><![CDATA[There is an approach to problem solving where you take simpler and simpler subproblems until they are quite obvious, and then you build back up to the thing you want.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Weighted Union Find and Ground Knuth Bendix Completion</title><link href="https://www.philipzucker.com/weighted_uf/" rel="alternate" type="text/html" title="Weighted Union Find and Ground Knuth Bendix Completion" /><published>2026-02-18T00:00:00+00:00</published><updated>2026-02-18T00:00:00+00:00</updated><id>https://www.philipzucker.com/weighted_uf</id><author><name></name></author><summary type="html"><![CDATA[A union find variant I think is simple and interesting is the “weighted” union find. Deciding who becomes parent of whom in a call to union is decided by comparing weights. “Weight” is distinguished from “size” or “rank” in that weight is considered a property of the id given by the user, not a internal property of the data structure. It is also distinguished from a semigroup or lattice element because it is associated with the id, not the equivalence class the id belongs to.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">SMTLIB as a Compiler IR I</title><link href="https://www.philipzucker.com/smt_compiler_i/" rel="alternate" type="text/html" title="SMTLIB as a Compiler IR I" /><published>2026-02-09T00:00:00+00:00</published><updated>2026-02-09T00:00:00+00:00</updated><id>https://www.philipzucker.com/smt_compiler_i</id><author><name></name></author><summary type="html"><![CDATA[I like SMT solvers. Compilers are cool. What kind of babies can they make?]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Calling Lean Functions As Python Functions</title><link href="https://www.philipzucker.com/leancall/" rel="alternate" type="text/html" title="Calling Lean Functions As Python Functions" /><published>2026-02-02T00:00:00+00:00</published><updated>2026-02-02T00:00:00+00:00</updated><id>https://www.philipzucker.com/leancall</id><author><name></name></author><summary type="html"><![CDATA[I think Lean is neat.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Term Ordering Etudes: Ground Lexicographic Path Ordering</title><link href="https://www.philipzucker.com/lpo_etudes/" rel="alternate" type="text/html" title="Term Ordering Etudes: Ground Lexicographic Path Ordering" /><published>2026-01-26T00:00:00+00:00</published><updated>2026-01-26T00:00:00+00:00</updated><id>https://www.philipzucker.com/lpo_etudes</id><author><name></name></author><summary type="html"><![CDATA[Term orderings are a concept that is both obvious and bizarre.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://www.philipzucker.com/assets/logo.png" /><media:content medium="image" url="https://www.philipzucker.com/assets/logo.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry></feed>