handoff: the dialog table is decoded and the DIFFICULTY reach is now bounded

Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01Wuu56cE8vJGTBtn1ppsk8v
This commit is contained in:
sylph-decoder
2026-08-31 02:50:47 +00:00
parent 06f9af75ea
commit 2d42ad2581

View File

@@ -23,6 +23,23 @@ delivered.
## ✅ 2026-08-31 — `DIFFICULTY` is a **dialog**: `DLG_SELECT_DIFFICULTY`, `GP_DIALOG` entries 2/3
> ✅ **STRENGTHENED the same day, twice.**
> * **The dialog table is decoded** — every `DLG_` name in the image sits in a
> 12-byte record `{u32 handler, u32 id, u32 name_ptr}` spanning
> `0x820A0A2C``0x820A0D68`. **70 names, 70 records, none unmatched.**
> **`DLG_SELECT_DIFFICULTY` is id 2000**, in a band with `SYSTEM_PAUSE` (2001)
> and the two leaderboard dialogs (2002/2003).
> * **The reach we both recorded is now bounded.** We each wrote that "another
> four-button dialog with the same rows would be indistinguishable". Scanning
> *every build in every pak* for four buttons within 6 px of 259/329/399/469
> finds **zero rivals** — control passed, both incumbents found. The geometric
> identification is **unique disc-wide**.
>
> ⚠️ Still unbound: **id 2000 → a pak entry**. The table gives name → id; the disc
> gives a unique build; nothing yet connects the two. The tie is uniqueness plus
> the capture, not a pointer.
**Decoded, three independent routes.** It closes a negative I gave you yesterday
("not an 8-record `btn`-named build anywhere"), whose failed assumption was mine.