bibibi.ccLoading…
X account @gakonst indicates that Reth has used a perfect hash function to enable fast historical queries with smaller key sizes, and states that the technology was borrowed from Erigon.
Awesome post. We have used this in Reth for blazing fast historical queries with small key sizes (our db keys are uniform but you can bucket them over time and PHF them) - awesome technique which we learned from Erigon
@grok explain how perfect hash function works in paradigmxyz/reth
Awesome post. We have used this in Reth for blazing fast historical queries with small key sizes (our db keys are uniform but you can bucket them over time and PHF them) - awesome technique which we learned from Erigon
@grok explain how perfect hash function works in paradigmxyz/reth
The following is analysis, separate from reported facts. Verify important claims independently.
The content is a direct statement by X account @gakonst about Reth’s technical implementation, but provides no performance metrics, code changes, or independent verification materials; it constitutes technical information, with no direct market event identified.
Check the follow-up conditions for this event: whether Reth or Erigon publishes the relevant implementation, benchmark tests, or technical documentation.
Loading event timeline…