Trustless Log Index Breakout #3, Feb 17, 2026

Protocol Calls & happenings
1

Agenda

  • Presentation of the proposed historic index table ZKP architecture draft
  • Discussion

Meeting Time: Tuesday, February 17, 2026 at 15:00 UTC (60 minutes)

GitHub Issue

2

YouTube recording available: https://youtu.be/710mZYDRtPE

3

Meeting Summary:

Zsolt presented his design for a logarithmic index table system that generates search tables for Ethereum blocks, including both single-block and asynchronous table generation, with plans to use zkProofs for storage optimization. He demonstrated the system’s proof and search capabilities, and outlined his approach to verifying table correctness through recursive slicing and marker proofs. The discussion concluded with Kevaundray providing feedback on proof systems and suggesting Ketch as an efficient hash function for ZK proofs, with both parties agreeing to separate the recursive proof logic from the core table index logic for easier implementation.

Click to expand detailed summary

Zsolt presented his latest design for a logarithmic index table system that generates search tables for Ethereum blocks. He explained how the system works, including the generation of single-block tables during block processing and larger tables asynchronously. Zsolt also discussed his plans to use zkProofs for larger tables to reduce on-chain storage requirements. He showed examples of how the system could be used for proofs and searches, and outlined his approach to proving the correctness of the tables using recursive slicing and marker proofs.

Zsolt presented his idea for a recursive proof system to verify table merges in a Log Index, and Kevaundray provided feedback on its feasibility. They discussed the differences between Stark and SNARK proof systems, with Stark proofs being larger but post-quantum secure, while SNARK proofs are smaller but not post-quantum. Kevaundray suggested starting with Ketch as the hash function for ZK proofs due to its efficiency on EVM accelerators. They agreed that separating the recursive proof logic from the core table index logic would make implementation easier.

Next Steps:

  • Zsolt: Present at EF day on Thursday at Denver
  • Kevaundray: Get back to Zsolt on which zkVM teams expose recursive proof APIs
  • Zsolt: Check out the zkVM framework link that Kevaundray pasted in the chat
  • Zsolt: Polish the table proof implementation code (currently 400-something lines)
  • Zsolt: Rewrite the Go specification in Rust
  • Zsolt: Work on documenting the proof verification code
  • Kevaundray: Talk to Zsolt offline about accessing hash accelerators in zkVMs when he gets to implementation
  • Zsolt: Read up on the links Kevaundray sent
  • Zsolt and Kevaundray: Continue discussion offline about implementation details

Recording Access: