docs: changelog note for B-tree v2 internal node checksums

Co-Authored-By: Claude Opus 5.5 (1M context) <[email protected]>
2026-09-26 14:11:47 -05:00
parent 04a7f6f6c7
commit 1ea9132e10
1 changed files with 4 additions and 0 deletions
@@ -29,6 +29,10 @@
  resolves). Before, the listing skipped a dangling first link and listed
  the name via a later one that lookup did not follow, and path resolution
  followed the last.
+- **B-tree v2 internal nodes are checksum-verified.** Lookups prune
+  children by internal-node keys, so a corrupted internal node could hide
+  a name with no error; a mismatch is now `ChecksumMismatch`, as in
+  libhdf5, for lookups and listings alike.
 - **`Group::entries()` and `File::group_at(address)`**: a listing's
  `(name, address)` pairs, to open children without looking names up again.
 - Test: `crates/clawhdf5/tests/indexed_lookup_interop.rs` — every child of