0.9.0: tree-search simplify kernel + representation/equivalence separation + certified constant folding#40

Merged

psaegert merged 16 commits into

mainfrom

release/0.9.0

Jul 24, 2026

Commits on Jul 24, 2026

feat(simplify): search the cancellation move graph instead of guessing an order

psaegert
and
claude
committed
perf(simplify): opaque region shape as a second seed, not a move

psaegert
and
claude
committed
refactor(cancel): one region shape -- neg/inv are ALWAYS connected

psaegert
and
claude
committed
perf(simplify): default node budget 24, chosen by measurement not by feel

psaegert
and
claude
committed
perf(cancel): collect the annotation tree once per expansion, not once per candidate

psaegert
and
claude
committed
refactor(simplify): the algorithm IS a tree search -- drop the fixpoint and the pre-fill

psaegert
and
claude
committed
docs: retire naming that the tree-search rewrite made false

psaegert
and
claude
committed
fix(simplify): iterate the pipeline to a fixed point; max_iter -> node_budget

psaegert
and
claude
committed
docs(simplify): record why operand sorting is not a search edge

psaegert
and
claude
committed
docs: node_budget=0 canonicalises, it does not return the input verbatim

psaegert
and
claude
committed
feat(simplify): separate masking from the equivalence kernel; certify the constant-fold

psaegert
and
claude
committed
0.9.0: version bump + changelog

psaegert
and
claude
committed
feat(simplify): soundness Mode API (SOUND/LOSSY) in place of the wildcard_all boolean

psaegert
and
claude
committed
feat(cancel): LOSSY relaxes cancellation's group-axiom gate, consistent with rules and fold

psaegert
and
claude
committed
docs: update the pipeline for the masking carve-out + document Soundness Modes

psaegert
and
claude
committed
style: cargo fmt (wrap collect_multiplicities signature; collapse a test tuple)

psaegert
and
claude
committed

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

0.9.0: tree-search simplify kernel + representation/equivalence separation + certified constant folding#40

0.9.0: tree-search simplify kernel + representation/equivalence separation + certified constant folding#40
psaegert merged 16 commits into
mainfrom
release/0.9.0

Commits on Jul 24, 2026

feat(simplify): search the cancellation move graph instead of guessing an order

perf(simplify): opaque region shape as a second seed, not a move

refactor(cancel): one region shape -- neg/inv are ALWAYS connected

perf(simplify): default node budget 24, chosen by measurement not by feel

perf(cancel): collect the annotation tree once per expansion, not once per candidate

refactor(simplify): the algorithm IS a tree search -- drop the fixpoint and the pre-fill

docs: retire naming that the tree-search rewrite made false

fix(simplify): iterate the pipeline to a fixed point; max_iter -> node_budget

docs(simplify): record why operand sorting is not a search edge

docs: node_budget=0 canonicalises, it does not return the input verbatim

feat(simplify): separate masking from the equivalence kernel; certify the constant-fold

0.9.0: version bump + changelog

feat(simplify): soundness Mode API (SOUND/LOSSY) in place of the wildcard_all boolean

feat(cancel): LOSSY relaxes cancellation's group-axiom gate, consistent with rules and fold

docs: update the pipeline for the masking carve-out + document Soundness Modes

style: cargo fmt (wrap collect_multiplicities signature; collapse a test tuple)