fabi/Sylpheed
1
0
Fork 0
Code Issues 9 Pull Requests Actions Packages Projects Releases Wiki Activity

re: MCOL array A confirmed as the per-cell record -- 100% once split

Browse Source 
Separating the two interleaved arrays by address and re-running the same three
criteria: array A (2509 records) gives byte3==1 at 100.00%, a valid cell index
at 100.00%, and the sphere reaching that cell at 99.92%. Array B (6467) gives
30.65% and 30.60% -- a different record type, and the control showing A's 100%
is not what any 32-byte block would score.

So array A is the per-cell record: cell index (x,y,z), count, pointer into array
B, bounding sphere -- the same role REGN's section 3 plays. That confirms the
earlier 50% was the interleaving artifact and not a half-working reading.

The split was crude, first-half-by-address giving 2509 vs 6467 rather than an
even cut, and A still came out at 100%. A rough partition isolating a perfect
population is stronger than a careful one isolating a good-ish population.

Array B's layout is still unread.
This commit is contained in:
Sylpheed RE agent
2026-08-26 08:32:41 +00:00
parent d1c89e5d79
commit e684eb45dd
1 changed files with 22 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
docs/re/structures/mcol-collision.md
View File

@@ -128,6 +128,25 @@ clean populations.
bounding sphere — the same role `REGN`'s section 3 plays. ❔ Array B's layout is
unread, and the split has not yet been re-run per array to confirm 100 % on A.
**Next step**: separate the two arrays by their start addresses (`0x74` → A,
A's pointers → B), then re-run the three criteria on A alone. If the reading is
right they go to 100 %.
### ✅ Split by array, and it goes to 100 %
Done. Separating the records by address and re-running the same three criteria:
| | array A (2 509) | array B (6 467) |
|---|---|---|
| byte 3 of word 0 == 1 | **100.00 %** | 30.65 % |
| bytes 0–2 a valid cell index | **100.00 %** | 30.60 % |
| the record's sphere reaches that cell | **99.92 %** | — |
**Array A is the per-cell record**, exactly as read: cell index `(x, y, z)`, a
count, a pointer into array B, and a bounding sphere — the same role `REGN`'s
section 3 plays. Array B is a different record type; its ~30 % is incidental,
and it is the control that shows A's 100 % is not something any 32-byte block
would score.
Worth noting the split was crude — "first half by address", giving 2 509 vs
6 467 rather than an even cut — and A still came out clean at 100 %. A rough
partition that isolates a perfect population is stronger evidence than a careful
one that isolates a good-ish population.
❔ Array B's layout is still unread. That is the next thing.