Zk pfp

Zk

@risotto

35 Following
56 Followers
Zk pfp
Zk
@risotto
When is the best time to take risks? When is the best time to build? When is the best time to do something? Now.
0 reply
0 recast
0 reaction
Zk pfp
Zk
@risotto
5/ I'm honored to be part of this journey, shaping the future of digital privacy and creating a more secure, equitable internet for all.
0 reply
0 recast
1 reaction
Zk pfp
Zk
@risotto
4/ Aleo's pioneering technology is set to redefine the standards of digital asset management, enable seamless trustless and private value transfers, and empower individuals with unparalleled control over their financial assets, personal data, and online identities, all while maintaining complete confidentiality and anonymity.
1 reply
0 recast
1 reaction
Zk pfp
Zk
@risotto
3/ With the launch of Mainnet, I'm excited to contribute in bringing this vision to life – transforming not only the blockchain landscape but the entire internet with the world's first privacy-preserving blockchain.
1 reply
0 recast
1 reaction
Zk pfp
Zk
@risotto
2/ Since its inception in 2019, Aleo's founding team has pursued a bold mission: to create a platform that harmoniously balances blockchain's transparency and immutability with robust privacy protections. This vision has captivated me from the start, and I'm ecstatic to now be a part of the team driving this technological revolution forward.
1 reply
0 recast
1 reaction
Zk pfp
Zk
@risotto
I'm stoked to be taking the next step in my career to join Aleo as a Developer Relations Engineer! As a former ambassador, I've had the privilege of witnessing its trailblazing approach to blockchain technology and unwavering commitment in revolutionizing digital privacy.
 πŸ§΅πŸ‘‡
2 replies
0 recast
4 reactions
Zk pfp
Zk
@risotto
Just started my @heylunchbreak. Come start yours or collect mine now!
0 reply
0 recast
0 reaction
Zk pfp
Zk
@risotto
Wake up bae, a new friend tech has dropped https://lunchbreak.com/?ref=zklim5389
0 reply
0 recast
0 reaction
Zk pfp
Zk
@risotto
Create real products and services that people are willing to pay for
0 reply
0 recast
0 reaction
Cassie Heart pfp
Cassie Heart
@cassie
This week, Q Inc has changed course with speaking with investors. Given I receive a lot of cold opens from investors on Farcaster, I would like to share that change with everyone publicly, and why. Moving forward, we refuse to even begin conversations with funds who have ever (or intend to) engaged in token warrants. It is clear our values and beliefs are diametrically opposed, and this is a far easier filter to save ourselves the time. It has been a long path to fundraising principally because we are operating from a perspective that as a company collaborating on a fair launched project, we can not and will not do token warrants. Despite being upfront about this, this topic has resulted in a lot of time wasted in talking with crypto funds, because they do not believe equity has a path to return for them, and ultimately decline. This is very telling because if they don't believe the company will be successful what use are the tokens, unless...?
47 replies
193 recasts
733 reactions
Base pfp
Base
@base
Introducing the Builder Resource Kit: An all-in-one launchpad for building on Base Everything you need to start building and growing your project, in one place Just build it base.org/getstarted
11 replies
80 recasts
308 reactions
jesse.base.eth πŸ”΅ pfp
jesse.base.eth πŸ”΅
@jessepollak
a 3 minute video to onboard your friend who runs a small business to USDC, @base, and the onchain economy RT for reach and help get your small biz friends onboard
19 replies
50 recasts
173 reactions
Zk pfp
Zk
@risotto
Pool has won Unplugged track! Thank you /nouns for selecting us πŸŽ‰ Had lots of fun building in Base /onchainsummer Buildathon! Coinbase Smart Wallet stacks are so powerful in providing better UX for Pool users, create and login wallet with only Passkey, Paymaster Service and Transaction Bundling, all of them are smooth πŸ’― We did integrate Stripe crypto on-ramp to further enhance UX although we can only submit to one track. Super excited to ship Pool soon for real world use case and get people started using it in physical events! Check out Pool here: https://devfolio.co/projects/pool-d35f
0 reply
0 recast
0 reaction
Valerie Song pfp
Valerie Song
@asiangirlsmiles
So I did a thing - Pool is one of the winners of the Unplugged Track at the Onchain Summer Buildathon πŸ₯³βœ¨ so fun to participate! Thank you to @base @nouns Check out Pool on @devfolio here: https://devfolio.co/projects/pool-d35f #121 on OpenSea: https://opensea.io/assets/base/0x59ca61566C03a7Fb8e4280d97bFA2e8e691DA3a6/121
0 reply
2 recasts
2 reactions
Zk pfp
Zk
@risotto
Woohoo! Just got my hands on a sweet little SBT as an Onchain Credential for participating in Onchain Summer Buildathon πŸ₯³βœ¨ @base @devfolio
0 reply
0 recast
1 reaction
Max Branzburg pfp
Max Branzburg
@max
I asked you 4 months ago if you wanted an onchain membership w/ free gas on Base Today, I shared that we're launching Coinbase One onchain - starting with free gas on Base, and expanding from there Excited to work w/ Base builders on offering more benefits and bringing Coinbase One members to your apps
50 replies
214 recasts
1012 reactions
Vitalik Buterin pfp
Vitalik Buterin
@vitalik.eth
Protip: you can come in to Brussels through Amsterdam. Passport control line in AMS is negligible (at least at 5AM, though I'm sure it's not too bad at other times either), and it's only a 2h train ride straight from the AMS airport to Brussels.
177 replies
1073 recasts
5056 reactions
Zk pfp
Zk
@risotto
Other than that, roots of unity enables Fast Fourier Transform to quickly evaluate and interpolate polynomials, making it more practical in term of efficiency. Given polynomial P(x) of degree n - 1, FFT can evaluate it at all n roots of unity in O(n log n) time. Plus we can do inverse FFT to reconstruct the polynomial P(x) given values of the polynomial at the roots of unity in O(n log n) time too. With all the nice properties of n-th roots of unity, we can now easily commit a vector v that is encoded as polynomial P(x) by evaluating it at secret random point s (or Ο„ with trusted setup) and prove the evaluation P(Ο‰i) = vi later with a proof. For more advance use cases, roots of unity helps facilitate verification of updating elements in dynamic vectors and ensure commitment remains valid. I spent lots of time trying to wrap my head around roots of unity that’s why this post is taking some time. πŸ˜… We’ll explore R1CS, QAP & Groth16 in the next post!
0 reply
0 recast
0 reaction
Zk pfp
Zk
@risotto
Vector commitment is simply committing a vector of values (an ordered list of elements). For example we have vector of {v0, v1, v2, …, v[n - 1]}, we can construct a polynomial f(x) such that f(i) = vi for i = 0, 1, 2, …, n-1. Committing polynomial f(x) means committing to the vector v, essentially compacting the vector v. To make things more efficient, we use n-th roots of unity Ο‰. The equation of n-th roots of unity is always x^n = 1, which means x^n - 1 = 0. Because n-th roots of unity is an abelian group itself, therefore we can encode a vector v of length n with n-th roots of unity Ο‰: P(Ο‰i) = v[I] where Ο‰ is a primitive n-th root of unity (i.e. Ο‰^n = 1 and Ο‰^k not = 1 for 0 < k < n)
1 reply
0 recast
0 reaction
Zk pfp
Zk
@risotto
For example: R(x) = y0 β‹…β„“0(x) + y1 β‹…β„“1(x) + y2 β‹…β„“2(x) + … And quotient polynomial becomes: Q(x) = (f(x) - R(x)) / A(x) Using Ο„ from trusted setup, the prove computes g^Q(Ο„) and the verifier verifies by checking pairings of: e(g^Q(Ο„), g^A(Ο„)) = e(g^(f(Ο„) - R(Ο„)), g) e([Q(Ο„)], [A(Ο„)]) = e([f(Ο„) - R(Ο„)], [1])
0 reply
0 recast
0 reaction