Repository navigation
Prism model: performance as theorems (Uorc.Performance, UC-PERF-02..09) - #138
Merged
Merged
Conversation
A step is one model input evaluated for one coded bit, read from a frame header alone. A codec point names basis, profile word, state and lanes. Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3LszhHCxmceQ2V8xxx
Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3LszhHCxmceQ2V8xxx
Uorc.Performance (src/Uorc/Performance.lex.tex) states the client's size, choice, decode cost and meaning as theorems that hold for every input, each kernel-checked: - archiveBound: a frame is settled against its raw frame, and the raw frame is 2 length varints (at most 10 bytes each), the input and 41 fixed bytes, so no one-object frame exceeds n + 61 bytes. - bestNoLargerThanEvery: the trial the portfolio keeps is no larger than any coded trial it scheduled. - decodeStepsBound: a step is one model input evaluated for one coded bit; a profile evaluates between 3 and 24 inputs, so decode takes at most 192 steps per modelled byte for every frame kind (raw, reference, ncm, ncm from a named state). Closed vectors: FULL 192, V03 160 steps per byte. - bestOfAdmittedIsExact: admission fails every trial whose decode differs from the input, so whichever codec point or named state coded a frame, only its size can change. - dominance (no larger in bytes and in steps) is irreflexive, transitive, never grows either coordinate, and its gain is bounded by the cost drop, so consolidating winners cannot cycle. The theorems are about the model's rules. tests/performance.rs holds the native constants equal to the model's, the theorem inventory complete, and every sampled native frame within the bounds (raw length, n + 61, no larger than each scheduled strategy, decodes to its input, steps within 192 n). The codec point's profile word carries bit 31 for the x86 filter (performance::POINT_X86), the strategy table's encoding. Registered as UC-PERF-02..06 (kernel_theorem), suite performance-theorems. Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3LszhHCxmceQ2V8xxx
Registry keeps UC-WEB-01 and UC-PERF-02..06; projections regenerated (34 ids). Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3LszhHCxmceQ2V8xxx
Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3LszhHCxmceQ2V8xxx
…l (UC-PERF-07..09)
Nineteen more kernel-checked theorems, drawn from what the rule30 work
established (a finite horizon decides a candidate; a known result is not
redone; a potential that only falls):
- boundedPortfolioSettlesTheSame: a trial abandoned at the raw length is a
trial of at most that many bytes, and the portfolio of abandoned trials
settles to the same size as the portfolio of complete ones. A trial no
smaller than a kept one changes neither the kept bytes nor steps.
- chosenIsLeast, chosenIsNoWorseThanRaw, chosenKeepsTheSize,
leastIsUndominated: choosing by fewer bytes, then fewer steps, keeps a
trial no later than every listed trial and the raw frame, of exactly the
size the bytes-only rule settles to, dominated by none of them.
- consolidationSpendsItsGain, potentialNeverRises: consolidating a
candidate lowers bytes plus steps by exactly its gain, and over any
sequence the potential never rises.
Native: performance::{Trial, gain, lex_gap, pick, chosen, consolidate},
tested exhaustively over small keys against the theorems' statements; the
encoder's bound returns the complete payload or none.
The released client still breaks byte ties by schedule order; UC-PERF-08
says so. The bytes-then-steps rule enters with the next model export.
Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_013Asa3LszhHCxmceQ2V8xxx
Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3LszhHCxmceQ2V8xxx
afflom
pushed a commit
that referenced
this pull request
Nov 11, 2026
#140 moved the encoder to planned frames and coded strategies, so the portfolio-as-table commit this branch carried for lane 3 leaves this PR (lane 3 brings it with the engine). frontier codes a codec point through uorc::compress_with_strategies over FrameEncoder's planned frames; the shipped plan writes the shipped stream (tested), and the offline corpus re-decides to the same claim. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3QshCSRwiddS64zU3j
afflom
pushed a commit
that referenced
this pull request
Nov 11, 2026
…ine file Merge main into the product model lane. model.json now reads frontier.toml's nested [[claim.members]] tables and model/engine.toml as uorc/engine/1 (rule30_state, [[strategy]] words named by [[weight]] index, [[generator]] weights). The theorems table is labelled for the performance rows it lists. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3PSU8BqT6iazmFzCy1
afflom
pushed a commit
that referenced
this pull request
Nov 11, 2026
compress_pieces and compress_frames take the portfolio table again on main's per-strategy coding; compress_strategy reads the shipped table. portfolio::STRATEGIES (decoded from weights.rs at compile time) and portfolio::plan stay for callers of the shipped portfolio. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_013Asa3LeJgXkUvvAfeAGt9A
Merged
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.
Requested by Alex · project thread
v0.5 lane 1 of 5: the universal layer.
Uorc.Performance(src/Uorc/Performance.lex.tex) states the client's size, choice, decode cost and meaning as theorems that hold for every input. 45 theorems, each kernel-checked bylexlean verify.archiveBoundbestNoLargerThanEverydecodeStepsBoundbestOfAdmittedIsExactdominance*boundedPortfolioSettlesTheSamechosenIsLeast,chosenKeepsTheSize,leastIsUndominatedconsolidationSpendsItsGain,potentialNeverRisesRows 07 to 09 carry over three things the rule30 work established: a finite horizon decides a candidate, a known result is not redone, and a potential that only falls.
What these do and do not say:
keep,best,settle,admitted,decodeSteps,bounded,pick,chosen,consolidate).crates/uorc/tests/performance.rsbinds the native client to them, one test per row: native constants equal the model's, the theorem inventory is complete, and on sampled frames (empty, tiny, text, noise, mixed) the native raw frame has the model's length, the kept frame is within n + 61 and no larger than each scheduled strategy's frame, every frame decodes to its input, its step count is within 192 n, and a payload abandoned at a bound is the complete payload or absent. The choice and consolidation functions are checked over every list of small keys.best, and the released client still breaks byte ties by schedule order. UC-PERF-08 says so; the bytes-then-steps rule and the zero-hit x86 exclusion enter with the next model export (the named-states lane).Also here:
uorc::performance(step measure, codec point κ, corpus κ, choice and consolidation functions) used by the other v0.5 lanes; a codec point's profile word carries bit 31 for the x86 filter (POINT_X86).UC-PERF-01 is not touched (#137 changes it). Not to merge before v0.4.0 is tagged.
Checks run locally:
lexlean lock --check,fmt --check --all,check --all(343 modules);lexlean verifyof the module;xtask check-model(37 ids);cargo clippy --workspace --all-targets -D warnings;cargo test -p uorc --test performance(8 tests);cargo test -p repo-conformance --test bdd.🤖 Generated with Claude Code
https://claude.ai/code/session_013Asa3LszhHCxmceQ2V8xxx