Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
haadcode
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
haadcode
6y ago
Can you elaborate why you think Rust is a better choice?
2.
▲
by
haadcode
6y ago
No, on both. See above.
3.
▲
by
haadcode
6y ago
> How do you know that? It's not inferrable from the DAG. Is sequencing also provided "a layer up"? I jumped the gun there and made an assumption that the value of a node is the LWW ordering :) Ok, so without that assumpti
4.
▲
by
haadcode
6y ago
almost! :) let me elaborate on few points. > you have to reference all of the current concurrent root nodes of the data structure, in effect becoming the new single root node correct, and more precisely the union of heads is the curren
5.
▲
by
haadcode
6y ago
The log described above is this https://github.com/orbitdb/ipfs-log
6.
▲
by
haadcode
6y ago
Great comments! Indeed, "sign your log appends" gives everything needed for authority. Re. transactions, from OrbitDB's perspective this would be application specific, so you could hook into traditional, centralized consensus
7.
▲
by
haadcode
6y ago
One great piece of writing to think about the use cases and what kind of systems and applications can be built following the concepts applied in OrbitDB is this "Local-first software" https://www.inkandswitch.com/l
8.
▲
by
haadcode
6y ago
Posted this in another reply above, but give this a read: "Merkle CRDTs" ( https://arxiv.org/abs/2004.00107 ).
9.
▲
by
haadcode
6y ago
> Last-Writer-Wins is a conflict resolution strategy that can be used by any kind of data type that needs conflicts resolved, CRDTs included. Unfortunately it's not a very good one: even if you use vector clocks instead of wall cloc
10.
▲
by
haadcode
6y ago
There's also a Go implementation at https://github.com/berty/go-orbit-db
11.
▲
by
haadcode
6y ago
To clarify here, OrbitDB's core is an append-only, immutable log CRDT. While a mouthful, what is gives, is a distributed (decentralized) database operations log. Almost any type of database, or data structure, can be then built on top
12.
▲
by
haadcode
6y ago
The use case is shared, mutable data structures that don't rely on central coordination or control.
13.
▲
by
haadcode
6y ago
> I guess performance and robustness were not a priority. You'd be surprised how well JS does on both fronts, in addition to being able to run across platforms :)
14.
▲
by
haadcode
6y ago
> * How did this project get started? What problem is it trying to solve? OrbitDB got started because we wanted to build serverless applications, especially for the web (ie. applications that run in the browser.) Serverless meaning "
15.
▲
by
haadcode
7y ago
Absolutely! I don't know the exact history and why it hasn't been applied much, and I'd be very curious to learn, but it's definitely a gem.
16.
▲
by
haadcode
7y ago
tldr version: https://en.m.wikipedia.org/wiki/Ambient_calculus
17.
▲
Mobile Ambients – process calculus for mobile computation (1998) [pdf]
(lucacardelli.name)
3 points
by
haadcode
7y ago
|
3 comments
18.
▲
by
haadcode
8y ago
To summarize the relevant links and Github repos, they are: https://tallylab.com/ https://github.com/orbitdb/orbit-db https://github.com/orbitdb/ipfs-log https://github
19.
▲
by
haadcode
8y ago
I think it depends on what the use case for IPFS is. Many use it "server-side" to just transfer and store files, so a "native client" makes a lot of sense. The IPFS devs always recognized the importance of the browser th
20.
▲
by
haadcode
8y ago
The ipfs.io url is a public IPFS gateway, ie. bunch of IPFS nodes running on servers and "caching" content to be served through that domain. From that perspective, you're not accessing the content through the IPFS protocol bu
21.
▲
by
haadcode
8y ago
Not quite. The data structures for the "database" part are more complex than a single json structure. Each update to the database is an "individual json" which get linked together using an append-only log CRDT ( https:&#
22.
▲
by
haadcode
8y ago
It's true that availability is not "automatic" as per the software itself (rarely is in P2P networks). To make sure the data stays online (whether IPFS or OrbitDB), one needs to make sure there are enough nodes serving the da
23.
▲
by
haadcode
8y ago
The blog post is accessible through IPFS here https://ipfs.io/ipfs/QmY2LufsW3v6AfxTTkp6SGqDGa5AeJhSZXH8RSs... in case the original link doesn't work.
24.
▲
by
haadcode
9y ago
This absolutely awesome! I'm very excited for AntidoteDB, for its use cases but also for the underlying, pioneering work you're doing on CRDTs. Thank you for doing it! <3
25.
▲
by
haadcode
10y ago
Unfortunately there's no proper demo page :/ We're working on improving the docs (we know this is big issues atm). There's an old version (from June) of Orbit at http://orbit.libp2p.io which you can try. Much
26.
▲
by
haadcode
10y ago
(IPFS dev here) js-ipfs, the Javascript implementation of IPFS, has made a lot of progress in the past 6 months. It's still early but totally usable. We've been working on go-ipfs and js-ipfs interop so that browser nodes can talk
27.
▲
by
haadcode
10y ago
The cool thing about unique hash per message is that it makes that message linkable in other applications, after all it's just an IPFS hash. So for example, if you share a file in Orbit, you can get that file with IPFS just like you wo
28.
▲
by
haadcode
10y ago
Developer of Orbit here. Great to hear all the feedback, thank you! Most questions have been already answered, but to clarify: Orbit indeed uses IPFS pubsub ( https://github.com/ipfs/go-ipfs/pull/3202 ) for rea