Sorry to hear. Irreducible did incredible work and (I think) was quite well funded.
Not a lot of people do this if they couldn’t find PMF. A lot of respect to the team 🙏🏼
Moved away from zk a bit and did some consensus and trading
Seems some good papers just got released recently
Congrats to everyone on the good results 👍🏻
vitalik wants STARKed posiden instead of verkle trees but true snark variant connoisseurs want BINIUSed grøstl for the stronger existing hash crypto-analysis
🥁New paper🥁
The Sum-Check Protocol over Fields of Small Characteristic, Joint with @SuccinctJT, links below.
Paper: https://t.co/eD1O60Z8cW
Blog: Sumcheck and Open-Binius: https://t.co/o0RDqqDVKh
Code: Smallfield-super-sumcheck: https://t.co/qsus8nGYlP
We're excited to share a preview of a Framework Laptop with a new CPU architecture today, and it's not the one you probably think it is. @DeepComputingio is creating the first partner-developed Mainboard, and it's powered by a RISC-V processor!
@MihailoBjelic ZK-ifying keccak merkle patricia trees with worst case 300 MB witness sizes is a non-starter.
The verkle tree spec is designed to be zk friendly (eg. choice of curve, using pedersen as the hash)
So switching to verkle helps with ZKing the L1.
This is T2 tower field
T2~ F2[x,y]/(x^2+x+1,y^2+xy+1)
Represent each number as a multilinear polynomial in x,y where the coefficients are the binary representation of the number.
So 1~1, 2~x, 4~y, 8~xy
This gives 6~x+y, and 2*6~x*(x+y)=x^2+xy=1+x+xy~1+2+8=11
2 + 2 = 0
2 * 6 = 11
3 / 5 = 9
3² + 8² = 11²
420 * 61779 = 1
It's the new math. If you use it, it becomes much easier to make proofs of things.
If you know, you know.