Understand: state assumptions, shapes/units and a counterexample.
Implement: reproduce a numerical example and inspect boundaries.
Investigate: compare one alternative under a matched budget.
Mechanism & assumptions
A draft distribution q proposes a token and the target p verifies it. Accept with min(1,p/q); on rejection sample from normalized positive residual (p−q)+. Omitting correction generally changes the output distribution. Actual acceleration depends on draft cost, acceptance, verification batching and workload.
Let ,0.3], ,0.6]. Accept A always and B with probability 0.5. Accepted mass is [0.4,0.3]; rejection mass 0.3 is reassigned to A, restoring [0.7,0.3]. When there is no rejection and the zero-denominator residual branch is never used.
Implementation exercise
Implement seeded sampling and compare output frequencies with p. Test on some tokens, , and sharply mismatched proposals. Report sampling uncertainty, then benchmark runtime separately.
Deliver code, fixed seeds, raw results and one counterexample. These are experiment specifications, not executed GPU benchmarks.
Does exact distribution mean identical output for a shared seed?
No. Different algorithms consume random numbers differently. Distributional correctness and sequence equality under a seed are distinct tests.
Original teaching examples; sources checked October 2026. These are foundational mechanisms relevant to engineering, not a claim to cover every latest model.
Conditional acceptance is min(1,p(x)/q(x)) for q(x)>0. Joint proposal-and-acceptance mass is min(p(x),q(x)). Rejection samples normalized positive residual; identical distributions need no residual draw.
Formula conditions, units and worked arithmetic reviewed. The implementation isolates one numerical mechanism; it does not train a policy or control real hardware.
Mechanism map: follow the transformations from top to bottom.
Before running: predict a boundary case
Accepted mass is .7, rejection mass .3; adding the residual exactly restores target p.
Hint: isolate the assumption
Keep the baseline input fixed, change one parameter or boundary, and compare both the numerical result and the claimed units. A passing example verifies this fixture only.
Minimal executable example
Save the example and linked modules in one folder. Use Node.js 22 or newer, then run node speculative-correctness.mjs. No third-party runtime dependencies.
Accepted mass is .7, rejection mass .3; adding the residual exactly restores target p.
Record input, code version, expected result and observed result in the notebook below. Then construct a counterexample that violates the assumption above and explain why the original conclusion no longer follows.
Before revealing an answer, predict one result. After the exercise, record the discrepancy and a transfer test. Saved locally across language editions.
The mathematical review scope is recorded per lesson. It does not establish empirical paper reproduction; report suspected errors in your notes. Review scope