Public Preview
Preview the first six Case Files before choosing a paid path.
- Case File #001
- Case File #002
- Case File #003
- Case File #004
- Case File #005
- Case File #006
Who It's For
What This Book Teaches
Access: Starter Access
Status: Requires Starter Access
Author: Garonzick D. Hall
Use Cases
Where You Will Use This
Intent
Name what must stay true before you move. Every correct algorithm preserves an intent from the first frame to the final proof.
Problem Space
The world the problem creates: inputs, candidates, constraints, and the environment where the answer must be found.
Answer Space
The set of possible answers — large enough to defeat guessing, small enough to collapse under evidence.
Decision Space
The lawful moves available at each frame. A good move shrinks the space without removing the answer.
Topics
Major Areas Covered
Intent
Problem Space
Answer Space
Decision Space
Frame
Invariant
Scanner
Recorder
Decisions
Repair
Final Proof
What You'll Learn
Core Learning Outcomes
Intent
Name what must stay true before you move. Every correct algorithm preserves an intent from the first frame to the final proof.
Problem Space
The world the problem creates: inputs, candidates, constraints, and the environment where the answer must be found.
Answer Space
The set of possible answers — large enough to defeat guessing, small enough to collapse under evidence.
Decision Space
The lawful moves available at each frame. A good move shrinks the space without removing the answer.
Frame
One complete cycle: observe, decide, eliminate, record, maintain. The unit of lawful reasoning.
Invariant
The guarantee that remains true at every step. When it breaks, the proof is corrupted until repaired.
Scanner
Movement through a world one frame at a time, collecting evidence without skipping candidates.
Recorder
Evidence remembered across candidates when later decisions depend on earlier observations.
Decisions
Lawful elimination, not guessing. Each decision must forbid something, or it constrains nothing.
Repair
Restoring the invariant when a decision breaks it — never proceeding on a corrupted proof.
Final Proof
The state where only one lawful answer remains and every other candidate has been eliminated.
Who It's For
Built for These Readers
Software developers who want to understand why solutions work
Computer science students building foundations before patterns
Developers preparing for technical interviews
Developers who rely too heavily on memorized patterns
Developers who want a repeatable reasoning process
Engineers who want to improve problem-solving discipline
Where It Fits
Where This Book Fits
The Three Moves
For each chapter, do the same three moves: name the problem space (what universe are we searching?), extract constraints (what becomes illegal?), and watch the space shrink (how elimination becomes certainty).
Read the free previewCounting vs Measuring
Dock A verifies a pallet by scanning every box one at a time. Dock B lifts the pallet once and reads a calibrated scale. Same truth, different method. The method a system uses to arrive at truth determines how fast it moves, how much it leaks, and how easily it can be exploited.
After the Book
What You Should Be Able To Do
Intent
Name what must stay true before you move. Every correct algorithm preserves an intent from the first frame to the final proof.
Problem Space
The world the problem creates: inputs, candidates, constraints, and the environment where the answer must be found.
Answer Space
The set of possible answers — large enough to defeat guessing, small enough to collapse under evidence.
Start with the Free Preview
Read Chapters 0–3 free. When the investigation pulls you in, Starter Access unlocks the complete Book Zero investigation plus the CCF Case Files.