From 1ea9132e10135e20c55536497bffc520814d0fdf Mon Sep 17 00:00:00 2001 From: osobh Date: Sat, 26 Sep 2026 14:11:47 -0500 Subject: [PATCH] docs: changelog note for B-tree v2 internal node checksums Co-Authored-By: Claude Opus 5.5 (1M context) --- CHANGELOG.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/CHANGELOG.md b/CHANGELOG.md index 70cd926..33e6bb6 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -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