Jan 3, 2025

The treatment of it as a specialized hashmap has one more implication. The link size (in this case 3 bytes due to the number of elements we need to index - block height) is used in the as the bucket element size, and also the single word logical body size stored in the header. In the templates this is also used for the conflict linked list pointers. That would result in each array element having an extra three bytes to hold an unnecessary null pointer. So there is an issue here where we need zero length links and 3 byte keys. I believe these are the same templatized size/type. That might be enough to cause it to become an array-indexed array, as opposed to a full hashmap. This is the fourth thing, and first to verify. That's it, just some implementation details for a single table. The table is a cache (disposable validation data), not archive (primary data). I think I'd name it prevout.