Archives
All the articles I've archived.
2026 2
January 2
-
Reversing 256 Bits Without a Loop: A Lesson in EVM Optimization and defeating Dark Huffoor in Huff
Solving the final Node Guardians Huff challenge by replacing O(n) loops with O(1) bitwise magic for Bits reversal of Uints.
-
Solidity is ~O(log n), I Needed O(1): Building a Constant-Time Dispatcher in Huff
Breakdown of my process on approaching node guardians huff challenge on optimized dispatchers.