Mar 13, 2025

So if the math holds up, this is a simple and very efficient complete solution to the confirmation problem. We retain a tiny list of double spent points and search them for each spend. Absent a tx pool this is almost always simply empty. At some point it may be necessary to make this table a hashmap itself, to control this search cost. So I’ll start with that but just use a trivial header.