Aztec Labs has acquired Obsidion, the team behind @ZKPassport.
The Obsidion team will continue to develop ZKPassport while also leading new consumer product developments.
The ZKPassport protocol will remain open source.
Introducing @AztecLabs_ - a standalone product studio built by the network’s original builders.
We’re not a third-party team learning the stack. We built it, and now we’re going to show the world what products are possible.
The secret weapon for lightning-fast authentication with Aztec is the ingeniously optimized ecdsa verification in barretenberg.
This isn't a theoretical optimization: we're talking <1s proving time & 30ms verification. Lets do a deep dive 🧵
(Source: https://t.co/W5KzSzReo6)
token 2022 passed six audits, used one of the simpler and more conservative zk systems - bulletproofs for confidential transactions.
And still had a fatal money printing zk bug. Moreover, a "not including all inputs in Fiat Shamir" bug, you'd think people would know to look for.
Zk is hard. We need to think of soundness verifiability more than prover speed.
In particular, it should be totally doable to come up with ways for the compiler to warn (or just not compile!) code with missing Fiat-Shamir inputs.
@levs57 Yes, the cost will be the same (I'm assuming you put the cost of writing module representations of A and B into O(1)). If using sumcheck + plonkish arithmetization + lookups you can easily disable unused relations so you are not paying for what you're calling "stack interactions"
@levs57 you can do this with lookups by making the selectors that enable/disable memory interaction and substitute indices for the permutation argument , it will just be part of the table
@weikengchen And investor job security should be directly related to their investments. They should be fired after one underperforming investment even if others are doing great.