HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
ipfs
papers
TeX2015–2021
ipfs / papers · Archived

papers

IPFS Papers (not specs)

Learning & Reference
Explore on GitHubRead Hacker News discussions
9Distinct people
9Mentions
0Explicit recommenders
145GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

IPFS Papers (not specs)

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 1:49:46 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year9 dated mentions

Observed mentions: 2015-04-04 18:57:48 UTC to 2021-11-12 17:22:22 UTC.

012342015-01-01 00:00:00 UTC to 2016-01-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments20152016-01-01 00:00:00 UTC to 2017-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2017-01-01 00:00:00 UTC to 2018-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-01-01 00:00:00 UTC to 2019-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments20182019-01-01 00:00:00 UTC to 2020-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2020-01-01 00:00:00 UTC to 2021-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2021-01-01 00:00:00 UTC to 2022-01-01 00:00:00 UTC (exclusive): 2 mentions; 1 submissions, 1 comments2021

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
20152015-01-01 00:00:00 UTC2016-01-01 00:00:00 UTC404
20162016-01-01 00:00:00 UTC2017-01-01 00:00:00 UTC101
20172017-01-01 00:00:00 UTC2018-01-01 00:00:00 UTC000
20182018-01-01 00:00:00 UTC2019-01-01 00:00:00 UTC101
20192019-01-01 00:00:00 UTC2020-01-01 00:00:00 UTC101
20202020-01-01 00:00:00 UTC2021-01-01 00:00:00 UTC000
20212021-01-01 00:00:00 UTC2022-01-01 00:00:00 UTC211

What Hacker News says

9 sources
hagbard_c·Nov 12, 2021
You need access to the internet, that's about it. IPFS can use any transport protocol (see section 3.2 in the whitepaper [1]), it uses a distributed hash table for routing purposes, content addressing to represent objects - these are immutable, once published they're available as long as there is a peer which has the object in cache or 'pinned' (permanently cached). Read the whitepaper and install [2] a node of your own to get a feel of the thing, you'll soon find out it is an amalgamation of earlier peer to peer systems. The go-ipfs daemon tends to be quite busy, it averages somewhere around 30% CPU, 500MB memory, 0.1Mb/s in, 0.04Mb/s out when hosting ~3GB of (self-generated, niche-interest, database-related) files. This busyness is acknowledged by the developers and should be addressed somewhere down the line. [1] https://github.com/ipf
Read the rest
s/papers/raw/master/ipfs-cap2pfs/ipfs-... [2] https://dist.ipfs.io/ (get go-ipfs)
In Webamp IPFS media player
emmanueloga_·Jun 12, 2019
Just today I was looking into IPFS vs DAT, does anybody have any insights about the similarities/differences other than the ones listed here [1]? From far away, DAT looks smaller and better documented (perhaps less ambitious, too?) Apparently the best IPFS overview is the 2015 paper [2] which looks pretty daunting and does not seem to cover any practical considerations. 1: https://docs.datproject.org/docs/faq#how-is-dat-different-th... 2: https://github.com/ipfs/papers/blob/master/ipfs-cap2pfs/ipfs...
In IPFS, Again
clueless404·Oct 27, 2016
> Yea, this is where you're mistaken. It cannot make you distribute anything! Oh, really? "In some cases, nodes must work for their blocks. In the case that a node has nothing that its peers want (or nothing at all), it seeks the pieces its peers want, with lower priority than what the node wants itself. This incentivizes nodes to cache and disseminate rare pieces, even if they are not interested in them directly." https://github.com/ipfs/papers/blob/master/ipfs-cap2pfs/ipfs... What's to say BitSwap won't proactively decide to download and start seeding some rare pieces of kiddy porn? > You only distribute what you download. As if that wasn't bad enough. > Don't download kiddy porn, and you won't distribute kiddy porn. How are you to know if a hash contains kiddy porn or not? You need to know if the hash contains kiddy porn before you dow
Read the rest
nload it, but to know if it contains kiddy porn you have to download it. Classic Catch-22. The only rational response to a system like this is not to use it. > How does BitTorrent protect me from unknowingly downloading kiddy porn? By not randomly downloading stuff from the Internet. By only downloading torrents, I have explicitly chosen to retrieve (hopefully from vetted and reputable sources). By giving me complete control and feedback on what I'm seeding. Obviously not ideal, but far better than what IPFS does. I also don't get how this central censorship authority is going to work. I very much doubt IPFS wants to become the Internet Police for Saudi Arabia. The whole thing is a futile attempt to appease lawmakers and dictators, since any filtering will be done clientside. Nothing is stopping the client from ignoring any blacklists. Any great or small firewall will just find it easier to block the whole thing than do some silly whack-a-mole deep packet inspection. How is IPFS not going to become a haven for kiddy porn aficionados? If the censorship authority publishes a list of blacklisted hashes, that's the same as publishing a directory of all the available kiddy porn. Oops! If the censorship authority requires each hash to be queried individually, it becomes a real honeypot for the state surveillance machinery. Not exactly great choices.
In IPFS is the Distributed Web
nicklaf·Sep 16, 2015
From section 3.7.2 of the IPFS paper [1], on IPNS ("Human Friendly Names"): While IPNS is indeed a way of assigning and reassigning names, it is not very user friendly, as it exposes long hash values as names, which are notoriously hard to remember. These work for URLs, but not for many kinds of offline transmission. Thus, IPFS increases the user-friendliness of IPNS with the following techniques. [1] https://github.com/ipfs/papers/raw/master/ipfs-cap2pfs/ipfs-...
In Hosting a simple static site on IPFS
Confiks·Sep 9, 2015
As for your first point, you should really first learn more about how IPFS handles content addressing. If you look at section 3.5 the paper[1], you see that a IPFS object consists of a free-form data field, and an arbitrary amount of links to other IPFS objects. This is a very flexible format that allows for caching. You talk about a page with comments. You could (this is an example) create three 'models': a Page, a PageBody and a Comment (which 'inherit' from IPFSObject). A Page would contain links to one PageBody and multiple Comment objects. Every time a comment is posted, a link is added to the Page object (so its hash changes), but the PageBody (where the majority of the page size presumably is) doesn't have to change. All peers can keep the same PageBody cached, while the latest Page contains all the desired comments. This caching m
Read the rest
echanism will also work for unchanged comments. Every time the Page changes, its hash would be published under some IPNS name, so peers will always retrieve the latest version. [1] https://github.com/ipfs/papers/raw/master/ipfs-cap2pfs/ipfs-...
In Neocities is implementing IPFS – distributed, permanent web
whyrusleeping·Aug 7, 2015
We have IPNS, which allows you to have a mutable pointer to immutable content in ipfs. On top of that, you can put your IPNS name (which is still a longish ugly hash) into a DNS record to hide everything away (although youre still depending on DNS at that point) If you want to read more about ipns, its discussed in section 3.7 of the paper[1]. Do note that a few things have changed since the paper was last updated, so its not the source of truth right now. [1]: https://github.com/ipfs/papers/raw/master/ipfs-cap2pfs/ipfs-...
In Ask HN: The Internet is getting lame. What's next?

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.