Jan 3, 2025

There is still the caveat that if we don't find the prevout.tx in a strong state we need to look for duplicates, but this is simple/free and preserves our loose coupling. The possibility of duplicate txs affecting strong double spends just requires that we enumerate them all (iterator walk thru spend table). But the table consolidation above reduces that significantly by removing a multiple of iterations (basically all outputs of a tx vs. the one we are looking for), and cuts the number of hashmap searches in half for this aspect, since both point and spend table were being searched. So it's something like 10B searches reduced to 2.5B, and other stuff. :)