Inspired by a blog post (https://freedom-to-tinker.com/2014/10/27/bitcoin-mining-is-np-hard/), I started investigating the problem of assembling the best block candidate (or at least a very good one). Assembling a "good" block is not very relevant today, but it will become more relevant in the future. Today a greedy solution is usually used: transactions are sorted by fee/size value and the best transactions are added until they reach the 1MB limit. However, the problem is not that simple (see blog post above). There are conflicts and dependencies between the transactions and a single conflict invalidates the whole block. So, my question is: how this problem is tackled in today's date?
Thanks in advance
[link] [comments]
No comments:
Post a Comment