feat!: compact block propagation

[sdbondi]

Description

• Changes the propagated new block message to contain <block_header, coinbase, excess_sigs>
• Reconciles incoming new block with known mempool transactions by excess signature
• Requests, if required, missing transactions from peer
• Failing that, request the full block from the peer
• Reduce (deallocate) mempool memory when transactions are removed
• Replace real time-based reorg pool expiry with block height-based expiry
• Clean up deprecated mempool messaging handlers etc
• Ensure DHT connectivity keeps hold of connection handles

Motivation and Context

In the majority of cases, the inputs, outputs and kernels to be inserted in a block are already known and exist in the mempool. Previously, a propagated new block message would just contain the block hash, requiring the node request the full block from the peer. This implementation provides the minimum block data required to assemble a valid block and propagates that message (typically less than 100kb).

How Has This Been Tested?

Updated tests, existing block propagation tests
Manually: 3 base nodes, 1 wallet and 4 blocks worth of transactions in the mempool on dibbler

[delta1]

Awesome! 👏

Some very minor comments while I build and test

[stringhandler]

So keen to try this out