5 ms·
So is this primarily for static websites? I don't see dynamic websites going too well with this system. Edit: If someone like GitHub supported this for GitHub
by giancarlostoro 11y ago
So is this primarily for static websites? I don't see dynamic websites going too well with this system.
Edit:
If someone like GitHub supported this for GitHub pages it would be a great step forward for this as well.
- Apofis 11y agoThis is also the qualm I'm having with it... it's great for HTML files, but dynamic websites go right the window.
- omphalos 11y agoI believe they have an "IPNS" protocol which is intended to handle mutations.
- Apofis 11y agoAny links, please?
- omphalos 11y agoYou can read section 3.7 of their paper for an overview: http://static.benet.ai/t/ipfs.pdf http://static.benet.ai/t/ipfs.pdf I imagine you could go through their codebase to try to see how far this has come along: https://github.com/ipfs/go-ipfs https://github.com/ipfs/go-ipfs According to this, it looks like the implementation is currently in progress: https://github.com/ipfs/go-ipfs/blob/master/dev.md https://github.com/ipfs/go-ipfs/blob/master/dev.md Hope something in there helps you.
- fryguy 11y agoHow dynamic? Resources can be updated to point to new immutable objects. For instance, as an operator of a website, I can sign the resource `/comments/10189265.json` as referencing an object with a particular hash, and then when there are additional comments, change the object it references. How fast things like this can update are dependent on the implementation, which I haven't read.
- jeswin 11y ago> So is this primarily for static websites? More work would be needed here perhaps. But decentralized apps should happen one day. As someone without real technical knowledge in security and decentralized platforms, I'd love to hear from some on HN where we really stand on decentralized apps and security. - Public data. Distributing, searching and querying is not a problem. - Restricted data. You'd be distributing encrypted data to peers. Now, if we have a way to send an encrypted query to the peer and have it run on encrypted data without the peer being able to understand the query or the data, we'd be set perhaps. - Obviously this would need application architectures to change. But that's solvable.
- johnmaguire2013 11y ago> Now, if we have a way to send an encrypted query to the peer and have it run on encrypted data without the peer being able to understand the query or the data, we'd be set perhaps. Is that possible? It doesn't seem to be "N versus NP" but it seems similar. How can a computer find a correct answer to a question it doesn't know? I suppose you could send off small units of processing across many nodes, such that none of them knows the full result set...
- jeswin 11y agoSince the private data and the query are from the same user, they could share some mathematical connection perhaps, which would allow a query to be done and the results sent back (results which only the user can decrypt). Google shows up plenty of articles on the subject, but I am not an expert to know where we stand on this.
- johnmaguire2013 11y agoInteresting. So you'd perform operations on encrypted data, and send back an encrypted result that's useful yet different from the original encrypted data, all without ever performing decryption? It seems possible but extremely tricky.
- 11y ago
- _prometheus 11y agoIPFS is designed with mutability in mind-- think of it like git branches which advance to newer versions. (though you can indeed get rid of version history in that pointer if you want). So, the short answer is "yes, IPFS will work with mutable content just fine", though _how_ the mutability works is a harder, deeper question. I think the best sources will be the paper, the talks on the website, and the FAQ: - https://ipfs.io/ipfs/QmR7GSQM93Cx5eAg6a6yRzNde1FQv7uL6X1o4k7zrJa3LX/ipfs.draft3.pdf https://ipfs.io/ipfs/QmR7GSQM93Cx5eAg6a6yRzNde1FQv7uL6X1o4k7... - https://ipfs.io/ https://ipfs.io/ - https://github.com/ipfs/faq/issues https://github.com/ipfs/faq/issues
- typish 11y agoThey could take an approach similar to how Freenet does dynamic things. See here for details: http://draketo.de/light/english/freenet/communication-primitives-2-discovery http://draketo.de/light/english/freenet/communication-primit... Freenet has a similar immutable datastore but chat, microblogging, etc have been built on it.
- adrusi 11y agoWith IPNS, which allows the creation of links whose destination can be mutated by whoever has the private key, you can implement quite a lot of interactivity. You won't ever be able to implement facebook over this platform, but you can replicate all of its functionality by using a tumblog-like architecture. Facebook's design is inherently centralized, and therefore doesn't really fit into the world of IPFS. The idea is that every user owns their own content, not some central organization. Every user maintains a log of all of their actions, like an RSS feed. Every time they make a status update, that's an item. When they comment on someone else's status update, that's an item. Even when they just like something, it's an item. Each update of the action log would also have send ping to all friends, over some kind of distributed IM like tox. They already need an IM connection like that for messenger. Given that information alone, anyone can reconstruct the activity of all their friends into a news feed, and post new content. You'd need a lot of client-side leverage, and the ability to upload to the IPFS network from the client, but all the dynamic information is there. And there you have a fully distributed facebook clone. More resilient and privacy-sensitive and monopoly-averse than even tools like diaspora and statusnet.
- _mhr_ 11y agoHow does friend recommendation work in a decentralized model?
- comex 11y agoIsn't friend recommendation mostly stuff like "people who follow you/you follow also follow X"? Maybe going one or two more follow hops, but not so far out that you need a global view of the social graph. If users of a decentralized network publish their following and follower lists, it should be pretty easy for a local crawler to check those hops.
- wisty 11y agoYou have friends. A script can check your friends, and make suggestions based on that. You won't have the full graph that Facebook does, but does that really matter? I suspect the best predictors of who your friends are would be people already in your network.