Visual course · 8 lessons

Evidence-First Claude Session Mining

Learn to inventory and structurally plan a large Claude Code archive without leaking payloads, while matching every claim to a direct receipt.

U1 LIVE: PROVENU2 LIVE: PROVENSYNTHETIC EXAMPLE

Start lesson 1 →

Evidence boundary

Lesson 1 · U1 LIVE: PROVEN

Evidence Before Interpretation

Start by deciding what can be known without opening a transcript—and write every unknown down.

Lesson 2 · U1 LIVE: PROVEN

Inventory Without Opening the Archive

Walk the whole tree, classify eligible files, and exclude symlinks without reading a single record.

Lesson 3 · U1 LIVE: PROVEN

Determinism and Honest Failure

The same tree produces the same bytes; a broken boundary produces an error, not a partial story.

Structural manifest

Lesson 4 · U2 LIVE: PROVEN

From U1 Metadata to U2 Structure

Cross the content boundary deliberately: stream structure locally, emit metadata only.

Lesson 5 · U2 LIVE: PROVEN

Stream Records, Never Emit Them

Frame physical records from byte chunks while preserving exact provenance and output silence.

Bounded planning

Lesson 6 · U2 LIVE: PROVEN

Hard-Capped Window Planning

Cover every byte with complete records, bounded overlap, and no window above the cap.

Lesson 7 · U2 LIVE: PROVEN

Overlap, Hashes, Journals, and Mutation

A plan is trustworthy only if every byte is attributable to one stable source snapshot.

Proof and continuation

Lesson 8 · U1 PROVEN · U2 PROVEN

Proof at the Real Boundary

Tests establish behavior; only the compiled live path plus an independent probe closes the capability claim.