Add bloom filter to hashset

[shargon]

Description

This pr add a bloom filter in order to speed up the hash searching

Type of change

• Optimization (the change is only an optimization)
• Style (the change is only a code style for better maintenance or standard purpose)
• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• Breaking change (fix or feature that would cause existing functionality to not work as expected)
• This change requires a documentation update

How Has This Been Tested?

• Test A
• Test B

Test Configuration:

Checklist:

• My code follows the style guidelines of this project
• I have performed a self-review of my code
• I have commented my code, particularly in hard-to-understand areas
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• I have added tests that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes
• Any dependent changes have been merged and published in downstream modules

[Wi1l-B0t]

It should add some benchmarks.
Maybe not faster.

[vncoelho]

This will be a good change, when you say it is ready we will test.

[vncoelho]

@shargon,

recently, in our investigations, we also considered a bloom filter hashset that is SENT together with the commit!

So, nodes can have a quite good idea of which transactions are in the mempool of other validators.

With such knowledge we were able to reach 150k TPS - 200k TPS theoretically.
However, this is currently not the need of our chain, but can be a great marketing and advance in the consensus.