Repository navigation
builder: cap a branch at ten rule tests; factor number tables by how a pair stands - #21
Merged
Merged
Conversation
A rule tested by its misses is a disjunction, which costs split more than a dispatch atom: google-link's 12-rule chain of compound misses stopped proving once factoring counted only nesting depth (#19). A chain now also factors past MAX_CHAIN = 10 rule tests, as before #19, while dispatch still counts toward MAX_DEPTH. afflom/me's 68 modules verify with it. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3QU8Mz6i7JNPDbNRBd
…tands A deep table no choice field can factor (afflom/me's chronology, Allen's interval relations over four numbers) is now factored by the pair of number fields that shortens it most: equal, below, above. Inside each standing the comparisons of that pair that hold are dropped and rules that cannot hold are left out. DR-17 checks Allen's relations against the flat first-match chain on every request; chronology's proofs verify in the locked SDK. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3QU8Mz6i7JNPDbNRBd
afflom
pushed a commit
to afflom/me
that referenced
this pull request
Nov 15, 2026
The re-vendored builder (afflom/prism-devrel#21, merge f8c0300) factors a deep table of number fields by how a pair of them stands (equal, below, above), so chronology's 14 Allen-relation rules prove. It joins the prompt set; only kappa still waits (BS-01). 68 modules verify in the locked SDK; 263 Rust tests pass. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3QU8Mz6i7JNPDbNRBd
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
What
MAX_CHAIN = 10. A branch, or the whole table, is factored once it holds more than ten rule tests. The overall nesting cap,MAX_DEPTH = 12, still counts the dispatch tests.x =? y(one test), thenx <? y, then the rest (two tests each). Inside a standing, comparisons of that pair that hold there are dropped, and rules that cannot hold there are left out.Why
inv001Holds..inv009Holds. A disjunctive test costssplitmore than a single dispatch atom does. Ten rule tests was the threshold before builder: factor a deep decision by nesting depth; lengthen a prefix an earlier app of the set holds #19 (FACTOR_AT = 11).Checked
node builder/test.mjspass.astartandbstartstand;lexlean verifyin the locked SDK reports "verified 68 modules". Chronology built on its own also verifies (verified 14 modules).🤖 Generated with Claude Code
https://claude.ai/code/session_013Asa3QU8Mz6i7JNPDbNRBd