Content
@
0 reply
0 recast
2 reactions
Igor
@igorline
Check out my Rust 🦀 solver for the latest Philosopher Stone challenge by @horsefacts.eth https://github.com/igorline/curta_18_rs I just cleaned it up today. Let's thread this together! 🧵
1 reply
1 recast
6 reactions
Igor
@igorline
The challenge is neatly crafted and well explained by the author now. https://twitter.com/eth_call/status/1706029458275119205 I teamed up with @plotchy and popular to tackle it. While @plotchy quickly grasped the essence of the puzzle, integrating with flashbots took some time provided valuable learning.
1 reply
0 recast
1 reaction
Igor
@igorline
My teammates managed to be 3rd and 4th to solve it 👏 . But I was away. Taking a risk and to practice, I chose to solve it with Rust. First, I created a simple huff contract to return the essence. The outcome? A concise runtime bytecode: `636cbf043d60e01b5f5260205ff3`
1 reply
0 recast
0 reaction
Igor
@igorline
I wrote some exhaustive search for garbage to append to runtime bytecode to get expected code hash. Not much optimized but finds hash starting with 3 bytes under 5-10 min
1 reply
0 recast
0 reaction
Igor
@igorline
Also you have to calculate the address of newly Codex clone to call that uses create2 and salt generated from current block number. Implemented it in Rust
1 reply
0 recast
0 reaction
Igor
@igorline
After you got your deploy bytecode you are ready to submit your bundle using flashbots. I used https://github.com/paradigmxyz/mev-share-rs by paradigm. Since flashbots does not produce every block, I implemented logic to resubmit at each block. You would have to stop it :)
1 reply
0 recast
0 reaction
Igor
@igorline
As a result 8 interconnected txs in one block 😅 https://flashbots-explorer.marto.lol/?block=18198204 Would be happy to receive your feedback on my Rust code
0 reply
0 recast
1 reaction
