# 🌟 EPF-5 | Week 2 🌟 ## Sections ``` • 📅 Update • 📆 Next Week Plan • 📚 Resources ``` ## Update 📅 This week, I delved deeper into the One-bit-per-attester idea and introduced myself to erasure codes, specifically Reed-Solomon encoding. I explored more data on Inclusion Lists and examined different design spaces. I also began formulating my own specification that combines the One-bit-per-attester and FOCIL ideas, preparing for the Rust implementation using Reth and Lighthouse. Additionally, I explored the Lighthouse node to familiarize myself with its structure and functionality in depth. ## Next Week Plan 📆 - Dive deeper into the Lighthouse codebase. - Work on the project specification. ## Resources 📚 - [Fork-Choice Enforced Inclusion Lists (FOCIL): A Simple Committee-Based Inclusion List Proposal](https://ethresear.ch/t/fork-choice-enforced-inclusion-lists-focil-a-simple-committee-based-inclusion-list-proposal/19870) - [Binary Reed-Solomon Encoding](https://en.wikipedia.org/wiki/Binary_Reed%E2%80%93Solomon_encoding) - [Reed-Solomon Encoding Explanation](https://tomverbeure.github.io/2022/08/07/Reed-Solomon.html)