Each record gathers what the project knows about packing \(n\)$n$ unit squares in the smallest square. It opens with the case’s visual summary: the best packing known, drawn large, then the number line of its lower and upper bounds, where each comes from and what is still open. Then come every bound, reported and verified, with its exact form or minimal polynomial and its credit; every result in the register that concerns the case, with its rungs; and the case file’s own account. All 324 are read from their records, packing/frontier/n-NNN.md, when the site is built. Each has an address of its own to share, such as cases/11.html, and a case in the frontier survey or the overview’s atlas grid opens the same record. In the index below, a solved case is set in the accent.