Trustless log and transaction index

Status history

1. Draft17 Jul 2024

Abstract

Replace the fixed 2048 bit log event bloom filters with a new lookup index data structure that can adapt to the changing number of events per block and consistently guarantee a sufficiently low false positive ratio, allowing efficient trustless proofs of log event queries, canonical block hash and transaction hash lookups. The proposed structure maps all index entries (log events, transaction and…