[bitcoin] dergoegge opened pull request #26140: refactor: Move CNodeState members guarded by g_msgproc_mutex to Peer (master...2022-09-move-cnodestate-msgproc-members) https://github.com/bitcoin/bitcoin/pull/26140
[bitcoin] fanquake merged pull request #26005: Wallet: Fix error handling (copy_file failure in RestoreWallet, and in general via interfaces) (master...fix_wallet_copyfail_nullresult) https://github.com/bitcoin/bitcoin/pull/26005
bitcoin/master 335ff98 Luke Dashjr: Bugfix: Wallet: Wrap RestoreWallet content in a try block to ensure except...
bitcoin/master c3e5365 Luke Dashjr: Bugfix: Wallet: Return util::Error rather than non-error nullptr when Crea...
[bitcoin] Xekyo closed pull request #26104: coin selection: Check whether feerate is higher than long_term_feerate only once (master...2022-09-high-feerate-optimization) https://github.com/bitcoin/bitcoin/pull/26104
I am studying Erlay. Is it aiming to optimize the traffic made by inv/tx messages? This is my understanding so far: https://github.com/vasild/bitcoin/wiki/Erlay, I must be missing something because it seems that traffic is just 2.4% from the total traffic. Or my node is giving me skewed results?
Is there any reason not to implement an allocation free implementation for https://github.com/bitcoin/bitcoin/blob/master/src/consensus/merkle.cpp#L67? it seems like that would be possible via a "recursion" algorithm (traverse down the tree to a leaf, then hash it with its neighbor, go up and then traverse into the sibling, slowly rising up the tree until you get the final root hash)