Avatar
powrespecter
27a9ee7edc5486882d7acd61e6631ff18a09e99b6ee5e45906f1d0dc60c61f5f
I respect proof of work. https://powrelay.xyz

You're very welcome!

Yes, but my opinion is even more radical. I think showing "difficulty" (whether it's number of leading zero bits, number of leading '0's in hex, or number of leading 'q's in bech32) is not ideal since something with 10 zeroes looks half as hard to generate something with 20 zeroes (or '0's or 'q's) when, in fact, it is 1,000 times easier to generate 10 zeroes.

On https://powrelay.xyz/explore I show the number of hashes needed (on average) to generate an event with that many zeroes. An event with 10 leading zeroes needs 2**10 = 1_024 hashes and one with 20 leading zeroes needs 2**20 = 1_048_576 hashes (on average).

That's right.

Each additional "0" in the hex id needs 4 more bits of pow (8 bits for "00", 16 for "0000", etc.) and each additional "q" in the bech32 event id needs 5 bits of pow (15 bits for "note1qqq..." and so on).

Foir this you need decentralized voting.

I think this is only possible with POW or some (yet undiscovered) solution to the WoT problem.

Working on a client that lets you sort by POW, maybe that'll be enough.

Who's writing a client in emacs lisp?

Filtering spam with POW seems to be working. A few spammers use pow (#[0]) but never as high as real people.