all comments

[]FrontPageGuardian -0 points

Some more information on PoW implementaion which is used on notabug. The hashing algorithm used is Argon2, which is meant to be resistant against gpu attacks. Nonce is computed as folows:

salt = nonce = {64bit timestamp in ms}{random 64bits} 
secret = nab/things/{id}/{votesup or votesdown}

//Argon2 parameters:
hashLength = 32
timeCost = 1
memoryCost = 10240
parallelism = 1

digest = hash(secret, salt, hashLength, timeCost, memoryCost, parallelism)

Next step is to check complexity of the digest. For current complexity value (6), this amounts to checking if the first byte of digest is less than 3, if not nonce computation step is repeated.

After digest with correct complexity is found, corresponding nonce is put to nab/things/{id}/{votesup or votesdown} soul on peer.

[]go2dfish -0 points

That's how votes work. Your CPU crunches numbers to find a solution and this limits how often you can vote.

https://en.wikipedia.org/wiki/Proof-of-work_system

[] -0 points

how does it limit the number of votes? all that does is limit how fast you can vote

[]go2dfish -1 points

It limits how often you can vote, it is a rate limit not an absolute limit.

[] -0 points

is there a reason to do this instead of just blocking voting for a minute at a time?

[] -0 points

this kind of solution only works in centralized environments

[] -1 points

36 seconds to get past the CPU voting and upvote the post.