![atarpara Profile](https://pbs.twimg.com/profile_images/1569545933490356224/MwYG9xhp_x96.jpg)
atarpara
@atarpara
Followers
840
Following
7K
Statuses
339
✯ https://t.co/GIde268mPb
mload(0x40)
Joined January 2015
RT @optimizoor: This is a good proxy to track smart wallet adoption over time. EVM. Accelerate.
0
3
0
@RaoulSaffron @_hrkrshnn @cantinaxyz How external function checks proper abi encoding for bytes[] calldata.
0
0
1
RT @optimizoor: Solady v0.1 is out. Big thanks: @base, @SpearbitDAO, @cantinaxyz Report in next post. Milady.
0
117
0
@tabishjshaikh @josephdelong @optimizoor Sometimes understading @optimizoor code is even hard for me.
0
0
3
@shafu0x @optimizoor Once you start to write everything in assembly after you will hate plain solidity.
1
0
1
An awesome and great puzzle for who want learn solidity assembly. I solved all of it in less than 2 hours and refreshed all my assembly knowledge. Great Job @RareSkills_io && @tanim0la
Learning by doing -- and then getting rapid feedback -- is the most efficient way to learn. Yes, good explanations help, but deliberate practice matters more. That's why we are proud to announce Yul Puzzles (linked next). You'll become fluent with Solidity's assembly language by working on problems that drill concepts like Yul syntax, ABI encoding, events, storage slots, memory, and others. There are 60 puzzles of gently increasing difficulty. Each puzzle contains a link to the Solidity documentation or a relevant RareSkills article in case you get stuck. And of course, it is free with no login. Just fork the repo and start practicing! You'll be happy to hear that this work was funded by a grant from the Ethereum Foundation. We are grateful for their support. @tanim0la was the primary author. It gets even better -- more puzzles are going to be added!
4
3
31
RT @optimizoor: I have to admit, I’m a newcomer noob who doesn’t know much about the EF and Ethereum’s history. But everyone is asking for…
0
10
0
calldata := 0x000000000000000000000000000000000000000000000000000000000000133700000000000000000000000000000000000000000000000000000000000043370000000000000000000000000000000000000000000000000000000000001337 explanation : calldatacopy(0x00, 0x00, 0x60) require(mload(0x00) = 0x1337 && mload(0x20) == 0x4337 && mload(0x40) == 0x1337) Playground link :
1
3
20
@AzFlin @optimizoor TBH, it may take some time to fully understand, but once you do, you’ll definitely love his code and tricks!
0
0
1
Thank you so much! 🙏 Working with @onchainheroes has been an incredible experience. The vision behind the project is truly next level, and @skarlywarly is an amazing founder — always ready to help and such a kind person.
if anyones looking for a cracked solidity dev, look no further than @atarpara We are working with him for all @onchainheroes and he has been a delight to work with. He is currently open to new work as he has some spare time rn (may change!)
0
0
16
Yup, it still works! Endianness (big-endian vs little-endian) refers to byte order in memory, but comparison instructions don’t care about byte order—they just compare the values as unsigned numbers. Let’s take a 2-byte example: x = ab (ASCII: a = 97, b = 98) y = ac (ASCII: a = 97, c = 99) Big-endian: ab > ac - ab < ac → 97 98> 97 99 - 97 98 < 97 99 → result=-1 Little-endian: ba> ca - ba < ca → 98 97> 99 97 - 98 97 < 99 97 → result=-1 The comparison logic works the same, regardless of byte order!
1
0
6