Anton
@all4you4
15 replies
35 recasts
337 reactions
49 replies
42 recasts
499 reactions
7 replies
6 recasts
72 reactions
35 replies
24 recasts
367 reactions
0 reply
0 recast
1 reaction
51 replies
85 recasts
821 reactions
23 replies
42 recasts
323 reactions
0 reply
0 recast
1 reaction
37 replies
72 recasts
518 reactions
94 replies
297 recasts
1297 reactions
0 reply
0 recast
0 reaction
A fun math aside, on the idea of splitting a large zk proving workload between multiple provers.
Suppose you have N provers, and you have a proving workload that you split into N parts (so, one part per prover). You require provers to pre-register, but registration is open-access.
Suppose you have a constant fault rate (eg. 1/5 of registered provers fail). Provers expect to complete in one round (eg. 3s). If one prover fails, other provers have to come in and re-prove that load. How many rounds does it take for the entire workload to get proven?
Answer: log*(N)
(yes, that's the iterated-log function)
Why:
In the first round, you go from N unproven workloads to N/5 unproven workloads
In the second round, each remaining workload gets assigned 5 provers, so per-workload failure rate becomes 1 in 5^5. So you go to N / 5 / 5^5 unproven workloads
In the third round, each remaining workload gets assigned ~5^5 provers, so failure rate is 1 in 5^(5^5). So you go to N / 5 / 5^5 / 5^(5^5) unproven workloads 17 replies
28 recasts
261 reactions
0 reply
0 recast
0 reaction
75 replies
237 recasts
1670 reactions
9 replies
37 recasts
163 reactions
54 replies
59 recasts
441 reactions
0 reply
0 recast
0 reaction
352 replies
1481 recasts
4521 reactions
0 reply
0 recast
0 reaction
0 reply
0 recast
0 reaction
