docs/trust.md lists every badge and verdict the app shows (where code came
from, what a compiler said, what a proof, the fuzzer, a translation and the
model machine say): what earns each one, what it means, and what it does
not mean. New badges get a row there in the same commit.
pixi run package zips the files git tracks, plus new files it does not
ignore, into package/programming-plus-<commit>.zip (marked -dirty with
uncommitted changes). The zip shared before this held .DS_Store files,
__pycache__ folders and __MACOSX entries (3,661 files); the package holds
none of them (1,694 files). Python standard library only.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
Every compile went to godbolt.org from the session directly. The roadmap
moves compiles, and later Dafny and Lean checks, to a pinned service of the
app's own, and godbolt has no service guarantee, so where a compile goes is
now one replaceable piece.
- src/services/compile-backend.ts: a CompileBackend (id, host, compiler,
compile), explorerBackend() for any service that speaks Compiler
Explorer's API at a base URL, GODBOLT as the default, and
compileBackend() / setCompileBackend().
- godbolt.ts: compileMojo takes a CompileTarget (base, compiler, host) and
names that host in its messages; the request body is unchanged, so
tests/mojo.test.mjs still holds it to what the corpus pipeline sends.
- Session.compile asks the current backend and records which host answered
(CompileRecord.host; older records came from godbolt.org).
- The Compiler view names the host it is asking and the host that answered.
The "Compiled on godbolt" badge keeps its wording until a second backend
is deployed.
A test sends a compile through a fake backend and a refused local address.
Manual check list: open a Mojo exercise in the Developer area, Compile &
run, and see "Asking godbolt.org (mojo_1_1_0)…" then "Mojo 1.1.0 on
godbolt.org" in the Compiler view.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
Whether the engines' changes went back to the course or the course took
them from here was an open question (docs/engines.md). Soundness fixes to
the prover cannot wait for a round trip through a repository with no engine
tests, so this repository now owns the engines.
- pixi run engines-export <course>/static builds and writes every engine
module into the course's static/js/: JavaScript modules as written,
TypeScript ones (logic, solver, vcgen) as built, without source maps.
- pixi run engines-diff now shows what the course has not taken yet,
comparing the file the course would receive with its copy. Both scripts
share the list of modules in scripts/engines-files.mjs.
- docs/engines.md describes the ownership, the prover's three modules and
its number model, the soundness tests and the bugs found so far, the
changes the course receives with the next export, and how to export.
- AGENTS.md gains a hard rule: never let the prover call something proved
that a run breaks, with how to add a soundness regression first.
- docs/app.md's Known limits no longer sends engine fixes upstream.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
vcgen.ts types the symbolic executor under strict mode: the store (a term,
or the mark of a variable not yet set), the translation context, the raw
obligations, the loop hooks the invariant inference uses, and the report it
returns (Obligation, UnitReport, Report, VerifyOptions, exported for the
next stages). The parsed program is still built by parse.js and check.js,
which stay JavaScript, so its nodes are typed as PNode: a kind, a position
and untyped fields.
The behavior is unchanged: every obligation of every exercise, corpus
program, lesson solution and example, and the regression programs, comes
out byte for byte as it did before the conversion. Places where the code
read a store value it knew to be a term now say so (valOf), and an unset
value read as a term becomes a fresh unknown (asTerm), which is what the
name lookup already did.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
The way out of a FOR EACH loop includes the case of no pass at all, but the
checker added "X is in the collection" to the loop's head state and then used
that same state as the way out. After a loop over an empty list the fact is
FALSE, so the checker held a contradiction and proved anything after the
loop, ASSERT 1 == 2 included (tests/prover/foreach-empty.pseudo). The fact is
now assumed only for the body of a pass.
The soundness test gains a canary: after every program that runs to its end
without input, ASSERT 1 == 2 is appended and must not be proved, since a
proof there means a contradiction on a path every run takes. A one-off scan
with the canary after every top-level statement of every program (476
points) found nothing else.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
This repository now owns the engines, and the next stages extend the prover
(a claims model, translation to Dafny and Lean, precision claims). Doing that
under strict mode needs the terms it reasons about to have types.
logic.ts gives the term language a discriminated union (Num, Lit, Sym, Bv,
Op, And, Or, Not, Cmp, Ite, App, Quant, QuantC) and types every
constructor, rewrite and printer. solver.ts types the rationals, linear
constraints, Fourier-Motzkin, union-find with congruence, the case split
and quantifier instantiation, and exports ProveResult and ProveOptions.
Walks that looked inside any kind of term through x[k] now go through a
small fields() helper that keeps the same order.
The behavior is unchanged: every obligation of every exercise, corpus
program, lesson solution and example, and the regression programs, comes
out byte for byte the same as before the conversion (kind, line, column,
label, status, paths, goal and facts as shown, inferred invariants, notes).
The few places where the JavaScript would have thrown on a null it never
receives (an identity for a quantifier that has one) now skip instead.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
The engines had no tests of their own in the course repository; this
repository now owns them, so a change to solver.js or vcgen.js needs
something to answer to besides the end-to-end tests.
tests/engine-solver.test.mjs holds:
- a table of goals the solver must prove (transitivity, integer
tightening, case splits, congruence on positions, DIV and MOD by a
constant, lengths at least 0) and goals it must leave unknown (a false
step, FLOAT tightening, products of unknowns, rounded FLOAT addition,
different positions); one known gap, 2X == 1 not seen as impossible, is
recorded so an improvement shows up;
- 400 random linear integer formulas with DIV, MOD, if-then-else and
boolean structure; every one the solver proves is checked against all
729 assignments of X, Y, Z in [-4, 4];
- programs whose obligations must come out proved or not: a counting loop
with its invariant, an index one past the end, a division that needs a
REQUIRE, FILL and RANDINT arguments, and the int-model note.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
The prover reasons about a FLOAT as a number: Y == Y holds, and X < Z or
X >= Z. The interpreter let 1.0E308 * 10.0 become infinity and X - X become
NaN and carried on, so a run broke claims the prover had proved
(tests/prover/float-overflow.pseudo proved ASSERT Y == Y with Y NaN).
The notation already stops on a FLOAT division by zero and on a whole number
past 2^53 - 1. It now also stops, with an 'overflow' error, when an
arithmetic result, a built-in's result or a literal is not a finite number
(finiteCheck in interp.js). Every run then stays inside what a proof covers.
Regression programs whose fix was to the language rather than to a rule now
say where the run must stop, with a RUN-STOPS header the soundness test
checks.
A unit that does FLOAT arithmetic now carries a 'float-model' note: FLOAT is
treated as a finite number, rounding is opaque, and the lab stops past about
1.8e308, while the generated Mojo goes on with inf or nan (stated for a
division by zero, the case probes/float-special has verified).
New probe mojo/probes/float-overflow.mojo asks the compiler what a Float64
product past the largest double gives; it is unverified and needs
pixi run mojo-verify-item 'probes/float-overflow' (network).
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
The prover could mark an obligation proved that a run of the same program
breaks. Two rules did it, both found with programs now in tests/prover/:
- Invariant inference (vcgen.js infer) stopped after four rounds and assumed
the candidates left even when the last round had still been dropping some.
A non-inductive guess became a fact, and a false ASSERT was proved
(houdini-cap.pseudo). Inference now runs up to eight rounds and keeps its
guesses only when a whole round leaves them unchanged.
- RAND(X) assumed 0 <= R < X for every X. For X <= 0 that fact is false
(RAND(0.0) is 0.0, RAND(-1.0) is in (-1, 0]), so the checker held a
contradiction and proved anything, even ASSERT 1 == 2 (rand-zero,
rand-negative). The fact now covers all three signs of X.
FILL and RANDINT assumed facts about their arguments that the interpreter
enforces by stopping the program, without asking whether the arguments are
allowed. A crashing call was reported as fully proved. They now raise an
obligation of a new kind, 'argument' ("Argument allowed"), mapped to the
runtime 'value' error, and their facts are guarded.
tests/prover-soundness.test.mjs is the gate: each regression program's
MUST-NOT-PROVE obligation stays unproved and is really broken by a run, and
across every exercise, corpus program, lesson solution and example, nothing
marked proved is broken by the fuzzer (kind, line, column) or by running the
program (kind, line).
In the app, a proved obligation that a generated input breaks at the same
place is now shown as broken rather than proved.
Proofs over INTEGER are about whole numbers of any size; a unit that does
integer arithmetic now carries an 'int-model' note saying so, with the lab's
2^53 - 1 limit and Mojo Int's wraparound past 2^63 - 1 (from the stored
godbolt answer for probes/int-overflow-int).
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ