Document not found (404)
+This URL is invalid, sorry. Please use the navigation bar or search to continue.
+ +This URL is invalid, sorry. Please use the navigation bar or search to continue.
+ +All of this is TODO. Comparison to existing protocols and projects (just to situate in context, not talk shit obvs)
+Triplet graphs similar to linked data fragments with envelopes. decoupling content addressing from versioning
+@user:blog or name so it can be referenced w.r.t its parent: @<ACCOUNT>:<name>See IPLD Codecs and Linked Data Platform spec
+Means of interacting with binary data.
+Describes
+How do we find people and know how to connect to them?
+How can we make it possible to have a protocol that is "open" when it is intended to, but also protects privacy and consent when we need it to?
+ +Making supra-peer clusters with explicit governance and policies for rehosting and sharing!
+Splitting data across multiple peers within a federation
+Federations MUST maintain a list of
+ +How is an individual peer identified?
+A given identity can have 0 or many instances - a manifestation of the peer within a particular server and runtime.
+Each instance indicates a collection of peers
+When connecting to a peer, the peer MUST tell the connecting peer of the instances that are within its permission scope.
+A given identity can have 0 or many bidirectional links indicating that the identity is sameAs another
An identity has a specific field indicating whether it is "active" or "retired," and can issue a special top-level link with given permission scope indicating the identity that succeeds it. +- eg in the case of harrassment, one can hop identities and only tell close friends.
+Any peer can operate as a "Pub" (in the parlance of SSB) or a bootstrapping node, where a dereferenceable network location (eg. DNS) can be resolved to a
+A given identity can have 0 or many static inbound references that can resolve a network
+ +All of this is very work in progress :) plz do not rely on any of the descriptions or statements here, as they are all effectively provisional.
+This site describes the implementation of the p2p linked data protocol in {{#cite saundersDecentralizedInfrastructureNeuro2022 }}
+ +What should explicitly be left out of the protocol?
+Things that are described in the spec, but details are left up to the implementation
+p2p-ld
+Overview of the various concepts that p2p systems have to handle or address with links to the sections where we address them!
+Additionally, p2p-ld considers these additional properties that are not universal to p2p protocols:
+All of this is very work in progress :) plz do not rely on any of the descriptions or statements here, as they are all effectively provisional.
+This site describes the implementation of the p2p linked data protocol in {{#cite saundersDecentralizedInfrastructureNeuro2022 }}
+p2p-ld
+All of this is TODO. Comparison to existing protocols and projects (just to situate in context, not talk shit obvs)
+Overview of the various concepts that p2p systems have to handle or address with links to the sections where we address them!
+Additionally, p2p-ld considers these additional properties that are not universal to p2p protocols:
+What should explicitly be left out of the protocol?
+Things that are described in the spec, but details are left up to the implementation
+Every link has an implicit backlink that can be accepted/denied by the owner of the referenced object.
+If a link is proposed from a blocked identifier, the proposed link is automatically dropped
+How is an individual peer identified?
+A given identity can have 0 or many instances - a manifestation of the peer within a particular server and runtime.
+Each instance indicates a collection of peers
+When connecting to a peer, the peer MUST tell the connecting peer of the instances that are within its permission scope.
+A given identity can have 0 or many bidirectional links indicating that the identity is sameAs another
An identity has a specific field indicating whether it is "active" or "retired," and can issue a special top-level link with given permission scope indicating the identity that succeeds it. +- eg in the case of harrassment, one can hop identities and only tell close friends.
+Any peer can operate as a "Pub" (in the parlance of SSB) or a bootstrapping node, where a dereferenceable network location (eg. DNS) can be resolved to a
+A given identity can have 0 or many static inbound references that can resolve a network
+How do we find people and know how to connect to them?
+Triplet graphs similar to linked data fragments with envelopes. decoupling content addressing from versioning
+@user:blog or name so it can be referenced w.r.t its parent: @<ACCOUNT>:<name>See IPLD Codecs and Linked Data Platform spec
+Means of interacting with binary data.
+Describes
+skos:sameAs - for declaring that a given triplet is equivalent to another.ordering - how the children are to be ordered
+declaration - makes numerical references stronger, but less predictable.alphabetic - makes numerical references weaker, but more predictableHow do we find peers that have subgraphs that are responsive to what we want?
+How to refer to a given container, eg.
+@user:containerName:childName
+or numerically
+@user:containerName:{0}
+Children
+How to refer to a specific version of a container
+References without version qualification indicate the most recent version at the time of containerizing the links.
+Using blank subgraphs to specify queries
+How can we make it possible to have a protocol that is "open" when it is intended to, but also protects privacy and consent when we need it to?
+Making supra-peer clusters with explicit governance and policies for rehosting and sharing!
+Splitting data across multiple peers within a federation
+Federations MUST maintain a list of
+Dummy change to check that we don't invalidate the rust cache on CI.
+Just a stub to check if mermaid works
+erDiagram
+ IDENTITY {
+ string hash
+ }
+ INSTANCE {
+ string ip
+ string client
+ }
+ BEACON {
+ string uri
+ }
+ IDENTITY ||--o{ INSTANCE : runs
+ BEACON }o--|{ INSTANCE : links
+ BEACON }o--|| IDENTITY : represents
+
+Every link has an implicit backlink that can be accepted/denied by the owner of the referenced object.
+If a link is proposed from a blocked identifier, the proposed link is automatically dropped
+ +How do we find peers that have subgraphs that are responsive to what we want?
+How to refer to a given container, eg.
+@user:containerName:childName
+or numerically
+@user:containerName:{0}
+Children
+How to refer to a specific version of a container
+References without version qualification indicate the most recent version at the time of containerizing the links.
+Using blank subgraphs to specify queries
+ +Dummy change to check that we don't invalidate the rust cache on CI.
+Just a stub to check if mermaid works
+erDiagram
+ IDENTITY {
+ string hash
+ }
+ INSTANCE {
+ string ip
+ string client
+ }
+ BEACON {
+ string uri
+ }
+ IDENTITY ||--o{ INSTANCE : runs
+ BEACON }o--|{ INSTANCE : links
+ BEACON }o--|| IDENTITY : represents
+
+skos:sameAs - for declaring that a given triplet is equivalent to another.ordering - how the children are to be ordered
+declaration - makes numerical references stronger, but less predictable.alphabetic - makes numerical references weaker, but more predictable