ZK-SNARKs are hard because the verifier needs to somehow check millions of steps in a computation, without doing a piece of work to check each individual step directly (as that would take too long).

We get around this by encoding the computation into polynomials.

A single polynomial can contain an unboundedly large amount of information, and a single polynomial expression (eg. ) can "stand in" for an unboundedly large number of equations between numbers.

If you can verify the equation with polynomials, you are implicitly verifying all of the number equations (replace with any actual x-coordinate) simultaneously.

We use a special type of "hash" of a polynomial, called a polynomial commitment, to allow us to actually verify the equation between polynomials in a very short amount of time, even if the underlying polynomials are very large

there are many (50+) variants of SNARKs

#Do
#research

Now since you are using TypeScript as a tool to help enforce some rules at design time


اگه از یه پراپرتی پرایوت خارج از کلاس تو تایپ اسکریپت استفاده کنی
تایپ اسکریپت ide جیغ میزنن اما اگه به زور کامپایلش کنی به js اکی هستش کد و اجرا میشه بدون مشکل چون js اکسس مودیفایر ها رو نمیشناسه

سر همین جمله اول جمله زیبا و کاربردی ای هستش :))

#research
#Do

eth privacy:

deterministic change on smart wallet admin key and this is deterministic just for the owner of the previous key + gasless transaction aproachs


برگرد ببین راهی هست که بتونی این deterministic change بودن رو پیاده سازی کنی


ببین تورنادو کش چجوری آدرس مقصد رو از کاربر دریافت میکنه جوری که لو نره کدوم ادرس رو کدوم واریز کننده داده ( شاید بتونه این جواب برای سوال بالات باشه)

#check
#do
انقلاب صنعتی پنجم؟؟

چهارمش که این همه داد و قال براش داشتن مگه انجام شد؟

https://www.linkedin.com/posts/karrari_%D8%A7%D9%86%D9%82%D9%84%D8%A7%D8%A8-%D8%B5%D9%86%D8%B9%D8%AA%DB%8C-%D9%BE%D9%86%D8%AC%D9%85-industry4iran-industry50-activity-6870043404944842752-_mA7

#Other

#Do

https://twitter.com/PulpSpy/status/1410256799794597901?s=19

#Bitcoin

#Do


proof of work VS nakamoto algorithm

https://courses.grainger.illinois.edu/ece598pv/sp2021/lectureslides2021/ECE_598_PV_course_notes3.pdf

#Other

#Do

https://en.wikipedia.org/wiki/Socialist_millionaire_problem

https://en.wikipedia.org/wiki/Yao%27s_Millionaires%27_problem

is blockchain platform agnostic as it does not use any feature
of the consensus or the communication layer and hence can
be implemented on most generic blockchain platforms, as
long as it provides Turing-complete programming capabilities.