# Updates Week 11-14

## Introduction

First a quick update of the past few weeks. Weeks 11-12 I had my midterms and was busy preparing for those. For weeks 13-14, I worked some more on writing the Log Index Root hash code. I have completed a basic implementation of all the modules required for that.

I have been testing the functionality, and it has a lot of bugs right now, which I need to fix.

This week I have implemented the hasher and the memory tree structures. The tree structure is also needed for the proof generation functionalities.

## Project
I am currently working on getting the log index root hash, which replaces the current bloom filter bits in the header of the block. It involves finding the root hash of a tree of all logs within an epoch and all epochs in the nodes history.

## Progress

In the past week I have done the following:

- I have completed the functions in the `hasher.rs`, `log_index_hasher.rs`, `mem_tree.rs` files.
- I am testing the individual components to see if they work correctly.

The Tree structure is a bit technical as it involves in depth knowledge of working of components.

## Path Ahead

My plan for the next week is to test more functionality and modify the components accordingly. Once that's completed, I can work on integration tests with the rest of the log indexer functionality.

## Resources used for learning
Some other resources that I used which aren't linked above.
- [2D Logs Index explainer video](https://github.com/etan-status/purified-web3/releases/download/2025-portal/2025-EIP-7745-Intro.mp4)
- [PPT Slides which explain the global log index](https://purified-web3.box/Slides/2025-EthereumZuri.ch.pdf)
- https://pureth.guide