
Zk
@risotto
0 reply
0 recast
0 reaction
0 reply
0 recast
1 reaction
1 reply
0 recast
1 reaction
1 reply
0 recast
1 reaction
1 reply
0 recast
1 reaction
2 replies
0 recast
4 reactions
0 reply
0 recast
0 reaction
0 reply
0 recast
0 reaction
0 reply
0 recast
0 reaction
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...? 46 replies
136 recasts
485 reactions
11 replies
52 recasts
212 reactions
23 replies
29 recasts
119 reactions
0 reply
0 recast
0 reaction
0 reply
2 recasts
2 reactions
0 reply
0 recast
1 reaction
62 replies
102 recasts
541 reactions
172 replies
679 recasts
4189 reactions
0 reply
0 recast
0 reaction
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
0 reply
0 recast
0 reaction