Mar 10, 2025

As I mentioned in the last meeting, the fundamental problem reduces to duplication detection of all spends in the point table (all ~2.5B hash:index values excluding coinbases). There is no need to maintain an accumulation of utxos or even the unspent points, just to know what are the points that have more than one entry in the table (typically there are none). There is no need to search the table to know this, because in theory it's most efficiently done upon insertion. At that point (download phase) we have the most free CPU available. But the point table is over 100GB and it's totally not feasible to search it for every insert, or at any other point, for every spend, on a low memory machine, due to paging cost.