XDI TC Notes

Following are the notes of the unofficial telecon of the XDI TC held on:

Date: Thursday, 7 June 2018 USA
Time: Noon - 1:00PM Pacific Time (19:00-20:00 UTC)

The TC operates under a standing rule approved 17 July 2008 under which the TC does not hold regular official meetings and conducts all business by electronic ballot only. Unofficial weekly meetings are held to enable discussion among members but no business is conducted nor actions taken.

ATTENDING

Markus Sabadello
Joseph Boyle
Drummond Reed

REGRETS

Phil Windley

NOTES

New Meeting Time

Due to a conflict that Phil has developed with the noon PT / 19:00 UTC time slot, we agreed to move the meetings to 1PM PT / 20:00 UTC.

JSON-LD 1.1 and XDI

We will look at the differences between JSON-LD 1.0 and JSON-LD 1.1, especially the concept of implicitly named graphs, and discuss how this relates to the XDI graph model.

Markus showed a few slides to explain the concept of "implicitly named graphs" in JSON-LD 1.1:

ODP:
https://www.oasis-open.org/committees/document.php?document_id=63218&wg_abbrev=xdi

PDF:

https://www.oasis-open.org/committees/document.php?document_id=63219&wg_abbrev=xdi

This is a feature that maps a JSON object in a JSON-LD document to an RDF named graph identified by a blank node. This allows RDF statements to be "grouped" or "put into context", which in turn makes it possible to apply LD signatures / proofs to parts of an RDF document.

Markus believes this new pattern in JSON-LD 1.1 is (at least partially) motivated by the requirements of the W3C Verifiable Credentials Working Group, which uses this feature for its "claim" JSON-LD term.

We discussed that there are similarities between "RDF named graphs identified by blank nodes" and XDI context nodes. However we also noted that:

In RDF, this only works "one level deep". In other words, it is possible to "put statements into context" by associating them with a named graph, but there is still no way to nest named graphs and to establish a tree structure as it is with XDI context nodes.
There is no concept of "root nodes" in RDF, and arcs are not required to be unique within a given node, therefore nodes are not universally addressable.

Markus still believes that by defining a set of constraints and other rules, it should be possible to express XDI graphs as RDF graphs.

Credentials/Proofs and XDI

Let's discuss how the concepts of Verifiable Credentials and Proofs can be modeled in XDI. For Rebooting-the-Web-of-Trust #4, Markus wrote a topic paper related to subject.

We will discuss this topic next week.

NEXT REGULAR CALL

The next call will be next week at the NEW time (Thursday 1PM PT). The link where agenda items can be posted for the next meeting is: https://docs.google.com/document/d/19oDl0lbb56Grehx2a5flZnhrgnua5l8cVvC_dJ8fTXk/edit?usp=sharing

xdi message