Honest by Construction

The B-tree and search path are recomputed before rendering.

highlighted = computed this step

The lesson author supplies inserts and optional expected checks. The engine recomputes the tree and recomputes any search path before rendering. Note: an expected value can only reject a mismatch; it cannot create the answer.

\text{recompute boundary}

Compiled tree

The recomputed tree has key count 6. Note: the structure in the diagram comes from inserts, not an authored tree.

k=6

a page models a node; real B-trees tune fanout to disk pages; tiny exact trees prove structure/search behavior only - no I/O or perf claims.

Compiled search

The recomputed search uses 3 comparisons. Note: a wrong authored path is rejected during the lesson self-test.

\text{comparisons}=3

a page models a node; real B-trees tune fanout to disk pages; tiny exact trees prove structure/search behavior only - no I/O or perf claims.

Summary

The trust boundary is recompute first, then render. Note: a page models a node; real B-trees tune fanout to disk; no I/O or perf claims.

\text{honest render}