Alexander Vlasov

94 posts

Alexander Vlasov

Alexander Vlasov

@Shamatar

Montréal, Québec انضم Nisan 2009
75 يتبع820 المتابعون
Alexander Vlasov أُعيد تغريده
Matter Labs (∎, ∆)
Matter Labs (∎, ∆)@the_matter_labs·
Just run a test with peak load of 100 TPS of ZK transactions on ETH mainnet. We could do more but hit the limit by consuming the entire capacity of DigitalOcean's largest suitable servers (next time AWS). Block explorer: mainnet.matter-labs.io
English
18
102
313
0
Alexander Vlasov
Alexander Vlasov@Shamatar·
@ebfull Correction - verifier was essentially incomplete, need to make an unhelped prover first for a proper testing
English
0
0
5
0
Alexander Vlasov
Alexander Vlasov@Shamatar·
@ebfull Single proof verification takes 1 million gas, not you bad. Will check later with a aggregate
English
1
0
1
0
Sean Bowe
Sean Bowe@ebfull·
I've been working on an implementation of the Sonic MPC for BLS12-381, to give succinct zero-knowledge to everyone with minimal trust. There are some new techniques and ideas that I want to explore with a wider community before we begin. DM me if you're interested in helping!
English
6
8
57
0
Alexander Vlasov
Alexander Vlasov@Shamatar·
@btcVeg @ebfull Also looks like naive efficient batching of SONIC proofs on a smart-contract is hardly possible using the smart-contract, cause every proof with advice requires around 13 multiplications in G1 with unique bases per proof
English
0
0
0
0
Alexander Vlasov
Alexander Vlasov@Shamatar·
@btcVeg @ebfull Groth16 with 1 input would be 500k, going down to 250-300k in a batched mode. I don’t remember exactly for Pinocchio, but may be around 2m
English
0
0
0
0
Alexander Vlasov
Alexander Vlasov@Shamatar·
@ebfull At least we’d need max circuit capacity for our Ethereum based solutions to have maximum efficiency per unit of gas
English
0
0
0
0
Sean Bowe
Sean Bowe@ebfull·
@Shamatar Perhaps, though in my experience I prefer to minimize the SRS size based on what we think people will conceivably need, since it makes for easier updates. (People can put it on DVDs, less bandwidth usage, etc.) I think this is considerably less than the maximal d possible.
English
1
0
0
0
Sean Bowe
Sean Bowe@ebfull·
I'm happy to announce Sonic, a new zero-knowledge SNARK developed in collaboration with Mary Maller, Markulf Kohlweiss and Sarah Meiklejohn. ia.cr/2019/099
English
10
127
372
0
Alexander Vlasov
Alexander Vlasov@Shamatar·
@ebfull Regarding the transcript - what would you suggest? A ceremony organizer has to verify a contribution and decompress the previous accumulator for a new contribution - that makes good checkpoints - so one can just truncate old records from the transcript assuming it’s verified
English
0
0
0
0
Sean Bowe
Sean Bowe@ebfull·
@Shamatar Looking at it. Cool! We need to make changes including: 1. The hash chain should be over the public keys so the parameters contain their own transcript, avoiding a gigantic transcript like in powers of tau 2. We don't need a randomness beacon, we'll use Fischlin transformations
English
5
0
1
0
Sean Bowe
Sean Bowe@ebfull·
Sonic doesn't require a trusted setup for each circuit, but only a single setup for all circuits. The setup never has to end, so it can be secured indefinitely by accumulating more contributions. (Only one previous contributor must be honest.)
English
4
12
51
0
Alexander Vlasov
Alexander Vlasov@Shamatar·
Rinkeby 0x6394b37Cf80A7358b38068f0CA4760ad49983a1B
English
0
0
0
0
Alexander Vlasov
Alexander Vlasov@Shamatar·
Supposed Plasma operator for test 1 : 0xe6877a4d8806e9a9f12eb2e8561ea6c1db19978d
English
0
0
0
0