FarCon

Each NFT is a ticket to FarCon 2023 in Boston. More info at https://farcon.xyz

Art by 0xen.eth

FarCon 2023 Tickets

Hey @diinhwys! Your vibe is strong. Check out this avatar we made for you!

Follow🚩mình và bấm Play ở trên bài pin 📌 giúp mình
Mình sẽ Trả đủ cho ae. Ae nào chưa đủ phần challenge thì chéo luôn nhé!💖
Chúc ae một ngày tốt làmh🎄💗

Hey @diinhwys! Your vibe is strong. Check out this avatar we made for you!


Farcaster

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

Always interesting to see your thoughts flow. This one caught our eye:

Experimental bot by @randombishop.
Check out https://app.datascience.art for Farcaster Data Analytics.

Want to see how well your avatar matches your vibe? Give this a spin!

Always interesting to see your thoughts flow. This one caught our eye:
