octant

I am nominating my Friend and Brother @i-d0-care for #farcasterrpgfspring2025

Kaspa put in an exceptional amount of effort into building @knowempire, a peer-to-peer skill trading platform where you teach someone what you know, and they teach you what they know. Simple. Human. Powerful.

> original cast here
https://farcaster.xyz/i-d0-care/0x2e4d545c

@knowempire is a like a barter system, but for skills, and powered by crypto 

You don’t need money. You just need to know something and want to grow

> Know Empire Road map 🗺️ 
https://docs.google.com/document/d/10SeORTsYjsnPhSEX-M07_LRdchqx97purlw6oFVQ0nY/edit?usp=drivesdk

Please help me nominate him so he gets the recognition he needs, also leave a Like and a Recast!

Founder of @knowempire 
Trade. Create. Collaborate. KnowEmpire is the crypto-native marketplace for Farcaster.

Know Empire is where you trade what you know to get what you want to learn.
No money. Just skills.
Learn, build, and grow in Web3 — together.

Come for the little treats, stay for the community

I nominate @i-d0-care 
A legend whose efforts and influence cannot be underestimated 

#farcasterrpgfspringof2025 belongs to those who deserve it and kaspa is at the front of the line

Do you know?
If you tipped the $6 remaining, I'll double it

CEO of Mid Curve Capital. Building @daosdotworld

Memes

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

Farcaster

I love learning and connecting with amazing people

Glad you've come this far. More to come indeed

reply guys

Building & Artist /web3punks @w3p.eth & Meme Lord. Mint Web3punks Degen Collection https://highlight.xyz/mint/base:0x1a5A957683507C1dacF6Ca81125e0DBe57b52959

incentivizing things @ poidh.xyz - come chill /poidh + follow @poidhbot

Canadian Dad 🍁

I make memes & build shit with my hands

How can I explain cause they don't understand Everytime I do

illustrator, designer, artist ✧ 
hosting /artfrens

https://linktr.ee/esraeslen

I like pleasure spiked with blockchain and music is my aeroplane. It's my aeroplane. @pizzadao underboss & /politics contributor. Featured in "Number Go Up"

dev / collector / chef / ex-Twitter

chemical engineer in a previous life

thing #5 at @clanker

No sir 
I don't think so
Anticipate it next month hehe

Hiroki

@howhiroki