- From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
- Date: Thu, 27 May 2021 10:53:11 -0400
- To: semantic-web@w3.org
I'm also confused as to why the difference between what this demo does and the algorithms in https://w3c-ccg.github.io/ld-proofs/#algorithms. There a single node is added to the graph but you add two nodes. (Well, not really, the algorithm adds triples that all come off a new node but your code adds triples that come off two nodes, one an IRI and the other blank.) How is this difference reconciled? peter On 5/27/21 10:08 AM, Eric Prud'hommeaux wrote: > I created a half-assed (UI-wise) but I think cryptographically sound > demo where you get to plug in your own document and proof structure. > > https://janeirodigital.github.io/rdf-sig-playground/index > > Help/suggestions appreciated. Help with bugs like > https://github.com/janeirodigital/rdf-sig-playground/blob/main/index.js#L214-L215 > actively solicited. >
Received on Thursday, 27 May 2021 14:53:26 UTC