@blockbot Steward. Frames Builder. Pro Chess-er ♟️


Learning about stealth addresses and damn. @moe was on point. 
Cryptography is some cool, hard and magically topic. 

I've come to a simple explanation that every single part of cryptography can be reduced to 
A = B + xC. Where x is some magically thing. Could be a hash, key, encryption model, elliptic curve wara wara. Doesn't matter. It's usually the hard part. 

In some cases, progress is made because "x" becomes too easy to crack , "x" can only support a certain number of generations (e.g 2^256 or stuff like that), or is simply too expensive . So the reasearchers  often have to keep doing "trial" and "error" till a better model is found and it keeps going. 

W crytpography researchers, engineers, etc. Keep doing what you do.

Learning about stealth addresses and damn. @moe was on point. 
Cryptography is some cool, hard and magically topic. 

I've come to a simple explanation that every single part of cryptography can be reduced to 
A = B + xC. Where x is some magically thing. Could be a hash, key, encryption model, elliptic curve wara wara. Doesn't matter. It's usually the hard part. 

In some cases, progress is made because "x" becomes too easy to crack , "x" can only support a certain number of generations (e.g 2^256 or stuff like that), or is simply too expensive . So the reasearchers  often have to keep doing "trial" and "error" till a better model is found and it keeps going. 

W crytpography researchers, engineers, etc. Keep doing what you do.

https://warpcast.com/moe/0x061637ef

https://vitalik.eth.limo/general/2023/01/20/stealth.html