Generate 50 coherent tokens
one move: control decoding randomness
Open the code pane immediately, then use the Spec tab, optional design question, tests, and artifact when you want them.
Finish each move before carrying the artifact forward.
Greedy, temperature, and top-p decoding trade determinism for variety.
Deliverable: Write the mechanism in one sentence.Implement a bounded generation loop with selectable decoding policy.
Deliverable: Type the smallest runnable implementation.The same seed and policy must reproduce the same token sequence.
Deliverable: Record the expected output and one edge case.Compare greedy, low-temperature, high-temperature, and top-p outputs.
Deliverable: Change one variable and explain the result.A decoding policy report with seeded samples.
Deliverable: Save the code, output, and a short failure note.The same seed and policy must reproduce the same token sequence.
Compare greedy, low-temperature, high-temperature, and top-p outputs.
A decoding policy report with seeded samples.
Mapped from the supplied Build Everything PDF, source page 36. The five moves are Deriva’s implementation contract for this project.