Anton
@all4you4
149 replies
261 recasts
1267 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 22 replies
24 recasts
242 reactions
0 reply
0 recast
0 reaction
72 replies
240 recasts
1687 reactions
17 replies
39 recasts
180 reactions
56 replies
55 recasts
456 reactions
0 reply
0 recast
0 reaction
637 replies
1494 recasts
4722 reactions
0 reply
0 recast
0 reaction
0 reply
0 recast
0 reaction
0 reply
0 recast
0 reaction
19 replies
52 recasts
281 reactions
0 reply
0 recast
0 reaction
17 replies
28 recasts
129 reactions
27 replies
162 recasts
919 reactions
0 reply
0 recast
0 reaction
0 reply
29 recasts
123 reactions
72 replies
181 recasts
1169 reactions
1 reply
5 recasts
53 reactions
