Some friends and I are working on how to bring authenticated data structures on RDF.

This consists in:

• Bringing secure links (either self-certifying or content addressed) to RDF
• Return very light proofs along with the result of simple operations that can be done in a triple store: add, update, delete, read/query/find triples

In practice, this effort is about the following:

Step 1: data model

1. normalize the rdf graph efficiently (see @msporny work)
2. if (Spec refining: Relative paths in IPLD ipld/specs#1) then replace the urls with relative paths (or (multi)hashes), otherwise build a causally linked history that can show circular links
3. hash everything (build a merkle graph)
4. Solve Clarify how the use of URI identifiers maps to IPLD graphs #155

Step 2: operations on graphs

• find optimal structures for crud proofs (updating client & server's digest - inspired by CONIKS, history trees & co)

Smallest tool that we can build:

• rdf to hashable graph
• hashable graph to IPLD

cc @flyingzumwalt, @csarven, @bergos