The problem is there will be multiple solutions that result in the same hash (collisions), but only one of them will be correct
And it would take an extremely long time to find them all, I don’t even think a modern GPU could do it in a lifetime
- 0 Posts
- 8 Comments
Joined 1 month ago
Cake day: July 29th, 2026
You are not logged in. If you use a Fediverse account that is able to follow users, you can follow this user.
1·25 days agollama.cpp is way better than Ollama. If you want a GUI then use Unsloth Desktop
Use llama.cpp or Unsloth Desktop with an uncensored/abliterated model. Gemma 4 models are great for chats. But I don’t think it would give you better answers than the people in this community. And I would be too afraid to give it a web search MCP while asking it questions about piracy.
A better place to ask about AI stuff would be [email protected]
I guess botched remasters aside lol, there isn’t really a limit to how poorly something can be done
There are other ways investigators could have connected activity to Ono. He may have used Nyaa without a VPN while logged into an account. Data from website cookies or content-delivery-network logs could also have been matched with Nyaa activity and tracker records. CODA has not said whether any of those methods were used.
VPN isn’t enough, you gotta worry about fingerprinting and cookies too. Recently it was revealed that Windows 11 has strong fingerprinting options that could be used to track you.
I wonder if they were using a VPN or seedbox. You could even do remote desktop into seedbox and browse the sites from there.
Old music doesn’t get re-recorded for digital releases, they pull it from the original master again, which is better and more authentic than vinyl.
I mean if you went to a concert would you want them to add hiss and pop to the performance so it sounds more like vinyl? Lol certainly you wouldn’t want them to intentionally worsen the signal-to-noise ratio
You’re looking for “2160p remux” torrents
Well the hashes are always much smaller than the actual data, otherwise downloading the hashes would take just as long as downloading the data lol.
So 16KB blocks means 131072 bits per block, subtract the 256 bit hash size and that means 2^130816 hash collisions
That’s a lot lol, you’ll never find which one is the correct one. Even if you instantly had a list of all values that match the desired hash, you’d have to check them all and somehow determine which one was correct.