* It has more wrong information than right information, with no way to tell the difference.
* If you had an oracle that could tell you how to get to the book you need, the navigation instructions to get to the book will be at least as long as the book, on average.
All computer files are sequences of bits. All sequences of bits are integers. All integers already exist in the infinite set of natural numbers. I can even calculate how big those numbers are given their bit count.
digits(bits) = ceil(bits * log10(2))
digits(32) = 10
digits(64) = 20
digits(128) = 39
digits(256) = 78
digits(512) = 155
digits(1024) = 309
digits(20 KiB) = 49,321
digits(2 GiB) = 5,171,655,946
We are merely discovering numbers through convoluted mental and technological processes. All our mental exertions result in the discovery of a number. This comment is a number.This isn't quite true. Natural language text compresses extremely well and you would only need length equivalent to the compressed form, not the original form. And if you wanted to go further, you could use a mapping where extremely short strings map to known popular books and only unknown works have longer encodings.
But if I built one, it would totally work that way.
Only if the oracle has all books that could possibly exist. If you're trying to find a book that already exists, that set is infinitely smaller.
There are also valid clients for completely unrelated protocols using the BitTorrent DHT to find each other.
"I didn't share that! It was on infohash.lol first!"
More details here: https://allthemusic.info/faqs/
I made something similar a while ago, the Hdd of Babel [2], which contains all possible files(*) , and wrote down some thoughts on it [3].
I really like how it makes us think about the nature of information.
[1] https://libraryofbabel.app/
[2] https://mkaandorp.github.io/hdd-of-babel/
[3] https://dev.to/mkaandorp/this-website-contains-pictures-of-y...
I can't follow the logic here. How does this detect other announcers?
https://en.wikipedia.org/wiki/Honeytoken
> In the field of computer security, honeytokens are honeypots that are not computer systems. Their value lies not in their use, but in their abuse.
That's not detecting "announcers", but maybe more like detecting "indexers".
In theory this could be used to share torrent links by a different reference (ideally you could also add an anchor too). Somebody else could have a page that takes keywords and points you to pages hosted on the site.
This is a sample of the client-side code I found handling that: https://infohash.lol/_next/static/chunks/pages/p/%5Bpage%5D-...
DHT crawlers/indexers already exist to perform that function; they crawl and store infohashes (+ metadata when they receive it) and allow users to search that metadata to return relevant infohashes
I can generate a Google link with an infohash in the same fashion: https://www.google.com/search?q=1548262051907755713575797913...
Yandex is the only search engine that's even marginal useful for that now.
I'm of the impression that serving either the infohash or the torrent is considered to violate DMCA. DMCA does not just forbid sharing copyrighted material, but also sharing links to the copyrighted material or generally anything that can help people bypass copyright protections (including software that can decrypt even trivial DRM).