upvote

points

by drum555 hours ago |
comments
upvoteby Retr0id5 hours ago|
next
[-]
I wrote one that uses opencl: https://github.com/DavidBuchanan314/anubis_offload
reply
upvoteby drum555 hours ago|
parent|
[-]
Bravo, you even implemented the midstate speedup from Bitcoin, that's way more impressive.
reply
upvoteby Retr0id4 hours ago|
parent|
[-]
It's not exactly rocket science heh, just baffling that the original anubis impl left an order-of-magnitude speedup on the table.
reply
upvoteby GeoAtreides4 hours ago|
prev|
next
[-]
>It's less proof of work and just annoying to users, and feel good to whoever added it to their site,

this is being disproved in the article posted:

>And so Anubis was enabled in the tar pit at difficulty 1 (lowest setting) when requests were pouring in 24/7. Before it was enabled, it was getting several hundred-thousand requests each day. As soon as Anubis became active in there, it decreased to about 11 requests after 24 hours, most just from curious humans.

apparently it does more than annoying users and making the site owner feel good (well, i suppose effective bot blocking would make the site owner feel quite good)

reply
upvoteby bawolff2 hours ago|
parent|
next
[-]
That doesnt mean the PoW is doing anything, it might just mean bots have js disabled.

I dont think the person was claiming annubis doesnt work, they were disputing PoW is the reason it actually works.

reply
upvoteby drum552 hours ago|
parent|
[-]
Yes, Anubis is just non standard and obscure, the proof of work bit is completely irrelevant (except for getting people on their phone to not visit your website).
reply
upvoteby Aurornis3 hours ago|
parent|
prev|
[-]
The Anubis difficulty setting is (or was) so high that nobody could visit the site without leaving it open for minutes or hours.
reply
upvoteby GeoAtreides3 hours ago|
parent|
[-]
>Anubis was enabled in the tar pit at difficulty 1 (lowest setting) when requests were pouring in 24/7

>difficulty 1 (lowest setting)

literally in the comment you're responding to

reply
upvoteby tredre32 hours ago|
parent|
[-]
> After 2 minutes at 150 kHashes on mobile, I finally see the first pixel of the progress bar filling up. Seems like it will take hours or a day to finish. Some estimate would have been nice.

Literally the grandparent of the comment chain you're responding to.

reply
upvoteby bawolff5 hours ago|
prev|
next
[-]
Shouldnt browser also have it implemented in c? Like i assume crypto.subtle isnt written in js.
reply
upvoteby drum555 hours ago|
parent|
[-]
It doesn't matter if your hottest loop is using string comparisons, as another poster pointed out in C you aren't even doing the majority of the second hash because you know the result (or enough of it) before finishing it. The JavaScript version just does whole hashes and turns them into a Uint8Array, then iterates through it.
reply
upvoteby bawolff2 hours ago|
parent|
[-]
I dont understand what you mean. Are you saying that in C you only calculate the first few digits of the hash? That's not how sha256 works.

Edit: oh i think you mean in c the string comparison short curcuits. I would expect the same to be true in javascript too. Its true in most languages.

Maybe you are just worried about general language overhead, which is a fair point. Is the anubis check even using multiple threads? For the c case, the real benefit wouldn't be if you can use C, but if you can use the GPU.

The whole thing is kind of silly though. SHA256 is a terrible choice of hash for PoW. They should be using argon2 or something memory heavy.

reply
upvoteby drum552 hours ago|
parent|
[-]
The language matters, but your original guess was actually correct, you can do tricks with sha256 where you only end up calculating a fraction of the total double hash in order to get a pass or fail.

Modern bitcoin miners do a double sha256 hash and increment in just a little bit more than a single hash of work. The input is 80 bytes, which is two compression rounds of 64 bytes in sha256, only the data in the second round has changed (the appended nonce), so you don’t bother doing the first compression round again. With other quirks you can end up doing multiple hashes at once “asicboost” due to partial collisions within the input too.

reply
upvoteby yborg5 hours ago|
prev|
[-]
Maybe post your brilliant solution to commercial companies with hundreds of millions in funding unrestrained bot scraping the Internet for AI training instead of complaining about people desperate to rein it in as individuals.
reply
upvoteby drum555 hours ago|
parent|
next
[-]
Anybody can prompt Claude to implement this, which was my point, it doesn't stop bots because a bot can literally write the bypass! My prompt was the proof of work function from the repository, asked it to make an implementation in C that could solve it faster, and that was about it.
reply
upvoteby throw109205 hours ago|
parent|
prev|
[-]
This is fallacious and extremely disrespectful (or even malicious?). You don't have to propose a way to fix a broken thing to point out that it's broken.

Normal and sane people understand this intuitively. If someone goes to a mechanic because their car is broken and the mechanic says "well, if you can tell that you car is broken, then you should be able to figure out how to fix it" - that mechanic would be universally hated and go out of business in months. Same thing for a customer complaining about a dish made for them in a restaurant, or a user pointing out a bug in a piece of software.

reply