Al
@simplecrypto
309 Following
48 Followers
525 replies
611 recasts
1103 reactions
0 reply
4 recasts
32 reactions
2 replies
1 recast
18 reactions
18 replies
69 recasts
429 reactions
1 reply
2 recasts
44 reactions
104 replies
28 recasts
407 reactions
1 reply
19 recasts
156 reactions
83 replies
78 recasts
726 reactions
12 replies
7 recasts
31 reactions
34 replies
54 recasts
122 reactions
61 replies
63 recasts
401 reactions
gm fartcasters, long-form 10K.world cast
Still blown away: 40,000+ real App Store installs in 6 days (even after filtering Watch-to-Earn farmers). We’re charting in multiple countries, early signal this might be big.
We’re holding off on scaling videos until tokenomics are tighter. WATCHCOIN still has $7M+ in liquidity locked — we want to honor that. Expect a major update by Friday or Monday.
What’s coming:
• Creator Presales for All
Soon, any creator can run a presale. X/Twitter links will help signal legitimacy. Once a presale graduates, they can post videos — expect creator growth to explode.
• Full Fee Subsidies
We’re working to subsidize all fees — rent, gas, etc. UX wins, but we’re building safeguards to avoid abuse.
• Claim Counts in Feed
Claim numbers will now show on each video. The first one? 30,000+ claims. Social proof = better discovery.
This is just Day 6. Thanks for the chaos, love, and belief. We’re building something new. Fast.
LFG !!! 8 replies
12 recasts
74 reactions
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
23 recasts
238 reactions
22 replies
12 recasts
179 reactions
7 replies
10 recasts
109 reactions
11 replies
1 recast
76 reactions
22 replies
12 recasts
45 reactions
35 replies
71 recasts
1474 reactions
7 replies
8 recasts
49 reactions
24 replies
24 recasts
222 reactions
