This dramatically speeds up block validation time because FindLotteryPos
is called for every output of every transaction in a block.
This particular implementation falls back on linear search which means no reindex is required. As more blocks are added, the faster validation will become because more entries will be added to the inverse position index.
This dramatically speeds up block validation time because FindLotteryPos is called for every output of every transaction in a block.
This particular implementation falls back on linear search which means no reindex is required. As more blocks are added, the faster validation will become because more entries will be added to the inverse position index.