Mar 13, 2025

The Bloom implementation is a minor modification to the hashmap header, returning a Boolean on element insert (FP), casing the table to search the body on insert, and returning a Boolean as well (duplicate inserted). When the caller gets this positive result, it inserts the point into the duplicates hashmap. Synchronization in this aspect is already controlled by the block downloaded result transitioning into validate and confirm only when the points and block are fully written. Unconfirmed duplicate points cannot have been confirmed so will not interfere.