-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathindex.html
2377 lines (2326 loc) · 77.6 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!DOCTYPE html>
<html lang="en">
<head>
<title>CBOR-LD 1.0</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8"/>
<script src="https://www.w3.org/Tools/respec/respec-w3c" class="remove" defer></script>
<script src="common/common.js" class="remove" defer></script>
<script src="common/jsonld.js" class="remove"></script>
<script class="remove">
var respecConfig = {
// extend the bibliography entries
localBiblio: jsonld.localBiblio,
// specification status (e.g. WD, LCWD, NOTE, etc.). If in doubt use ED.
specStatus: "CG-DRAFT",
// if you wish the publication date to be other than today, set this
//publishDate: "2018-09-11",
copyrightStart: "2020",
// the specification's short name, as in http://www.w3.org/TR/short-name/
shortName: "cbor-ld",
subtitle: "A CBOR-based Serialization for Linked Data",
// if there is a previously published draft, uncomment this and set its YYYY-MM-DD date
// and its maturity status
// prevVersion: "https://www.w3.org/TR/2020/PR-json-ld11-20200507/",
// previousPublishDate: "2020-05-07",
// previousMaturity: "PR",
// prevRecURI: "https://www.w3.org/TR/2014/REC-json-ld-20140116/",
// errata: "https://w3c.github.io/json-ld-syntax/errata/",
github: {
repoURL:"https://github.com/json-ld/cbor-ld-spec/",
branch: "main"
},
// if there a publicly available Editor's Draft, this is the link
edDraftURI: "https://json-ld.github.io/cbor-ld-spec/",
// testSuiteURI: "https://digitalbazaar.github.io/json-ld-api/tests/",
// implementationReportURI:"https://digitalbazaar.github.io/json-ld-api/reports/",
// crEnd: "2020-04-03",
// prEnd: "2020-06-18",
includePermalinks: true,
doJsonLd: true,
pluralize: true,
// Cross-reference definitions
xref: ["json-ld11", "json-ld11-api", "json-ld11-framing"],
// if you want to have extra CSS, append them to this list
// it is recommended that the respec.css stylesheet be kept
// extraCSS: [],
// editors, add as many as you like
// only "name" is required
editors: [
{ name: "Manu Sporny",
url: "http://manu.sporny.org/",
company: "Digital Bazaar",
companyURL: "https://digitalbazaar.com/"},
{ name: "Dave Longley",
url: "https://digitalbazaar.com/author/dlongley/",
w3cid: "48025",
company: "Digital Bazaar",
companyURL: "https://digitalbazaar.com/"}
],
// authors, add as many as you like.
// This is optional, uncomment if you have authors as well as editors.
// only "name" is required. Same format as editors.
authors: [
{ name: "Manu Sporny",
url: "http://manu.sporny.org/",
company: "Digital Bazaar",
companyURL: "https://digitalbazaar.com/"},
{ name: "Dave Longley",
url: "https://digitalbazaar.com/author/dlongley/",
w3cid: "48025",
company: "Digital Bazaar",
companyURL: "https://digitalbazaar.com/"}
],
// name of the WG
//wg: "JSON-LD Community Group",
group: "cg/json-ld",
// URI of the public WG page
//wgURI: "https://www.w3.org/2018/json-ld-wg/",
// name (with the @w3c.org) of the public mailing to which comments are due
//wgPublicList: "public-linked-json",
// URI of the patent status for this WG, for Rec-track documents
// !!!! IMPORTANT !!!!
// This is important for Rec-track documents, do not copy a patent URI from a random
// document unless you know what you're doing. If in doubt ask your friendly neighbourhood
// Team Contact.
wgPatentURI: "https://www.w3.org/2004/01/pp-impl/107714/status",
processVersion: 2018,
maxTocLevel: 4,
//alternateFormats: [ {uri: "json-ld11.epub", label: "EPUB"} ]
};
</script>
<style>
.hl-bold { font-weight: bold; color: #0a3; }
.comment { color: #999; }
table, thead, tr, td { padding: 5px; border-width: 1px; border-spacing: 0px; border-style: solid; border-collapse: collapse; }
table.example {width: 100%;}
.example > pre.context:before {
content: "Context";
float: right;
font: x-large Arial, sans-serif;
color: gray;
border: solid thin black;
padding: 0.2em;
}
.example > pre.frame:before {
content: "Frame";
float: right;
font: x-large Arial, sans-serif;
color: gray;
border: solid thin black;
padding: 0.2em;
}
.example > pre.input:before {
content: "Input";
float: right;
font: x-large Arial, sans-serif;
color: gray;
border: solid thin black;
padding: 0.2em;
}
.example > pre.result:before {
content: "Result";
float: right;
font: x-large Arial, sans-serif;
color: gray;
border: solid thin black;
padding: 0.2em;
}
.example > pre.turtle:before {
content: "Turtle";
float: right;
font: x-large Arial, sans-serif;
color: gray;
border: solid thin black;
padding: 0.2em;
}
.highlight.changed, .show-changes {
background-color: lime;
}
.show-changes.selected:before {
content: "de-highlight";
}
.show-changes:before {
content: "highlight";
}
aside.example {
overflow-y: hidden;
}
/* example tab selection */
.ds-selector-tabs {
padding-bottom: 2em;
}
.ds-selector-tabs .selectors {
padding: 0;
border-bottom: 1px solid #ccc;
height: 28px;
}
.ds-selector-tabs .selectors button {
display: inline-block;
min-width: 54px;
text-align: center;
font-size: 11px;
font-weight: bold;
height: 27px;
padding: 0 8px;
line-height: 27px;
transition: all,0.218s;
border-top-right-radius: 2px;
border-top-left-radius: 2px;
color: #666;
border: 1px solid transparent;
}
.ds-selector-tabs .selectors button:first-child {
margin-left: 2px;
}
.ds-selector-tabs .selectors button.selected {
color: #202020 !important;
border: 1px solid #ccc;
border-bottom: 1px solid #fff !important;
}
.ds-selector-tabs .selectors button:hover {
background-color: transparent;
color: #202020;
cursor: pointer;
}
.ds-selector-tabs pre:not(.preserve), .ds-selector-tabs table:not(.preserve) {
display: none;
}
.ds-selector-tabs pre.selected, .ds-selector-tabs table.selected {
display: block;
}
a.playground {
display: inline-block;
width: 150px;
border: 1px solid transparent;
border-top-right-radius: 2px;
border-top-left-radius: 2px;
background-color: rgb(192, 192, 192);
text-decoration: none;
font-size: 13px;
margin-bottom: 10px;
}
a[href].playground {
padding: 4px 0 3px 8px;
border-bottom: none;
text-decoration: none;
color: #666;
}
</style>
</head>
<body>
<section id="abstract">
<p>
CBOR is a compact binary data serialization and messaging format. This
specification defines CBOR-LD 1.0, a CBOR-based format to serialize Linked Data.
The encoding is designed to leverage the existing JSON-LD ecosystem, which is
deployed on hundreds of millions of systems today, to provide a compact
serialization format for those seeking efficient encoding schemes for Linked
Data. By utilizing semantic compression schemes, compression ratios in excess of
60% better than generalized compression schemes are possible. This format is
primarily intended to be a way to use Linked Data in storage and bandwidth
constrained programming environments, to build interoperable semantic wire-level
protocols, and to efficiently store Linked Data in CBOR-based storage engines.
</p>
</section>
<section id="sotd">
<p>This document is experimental.</p>
<p>There is a
<a href="https://github.com/digitalbazaar/cborld/">reference implementation</a> that is
capable of demonstrating the features described in this document.
</p>
</section>
<section class="informative">
<h1>Introduction</h1>
<p>
CBOR is a compact binary data serialization and messaging format. This
specification defines CBOR-LD 1.0, a CBOR-based format to serialize Linked Data.
The encoding is designed to leverage the existing JSON-LD ecosystem, which is
deployed on hundreds of millions of systems today, to provide a compact
serialization format for those seeking efficient encoding schemes for Linked
Data. By utilizing semantic compression schemes, compression ratios in excess of
60% better than generalized compression schemes are possible. This format is
primarily intended to be a way to use Linked Data in storage and bandwidth
constrained programming environments, to build interoperable semantic wire-level
protocols, and to efficiently store Linked Data in CBOR-based storage engines.
</p>
<section class="informative">
<h2>How to Read this Document</h2>
<p>This document is a detailed specification for a serialization of Linked
Data in CBOR. The document is primarily intended for the following audiences:</p>
<ul>
<li>Software developers who want to encode Linked Data in a variety of
programming languages that can use CBOR</li>
<li>Software developers who want to convert existing JSON-LD to CBOR-LD</li>
<li>Software developers who want to understand the design decisions and
language syntax for CBOR-LD</li>
<li>Software developers who want to implement processors and APIs for
CBOR-LD</li>
<li>Software developers who want to generate or consume Linked Data,
an RDF graph, or an RDF Dataset in a CBOR syntax</li>
</ul>
<section id="conformance"></section>
</section>
<section class="informative">
<h2>Contributing</h2>
<p>There are a number of ways that one may participate in the development of
this specification:</p>
<ul>
<li>Technical discussion typically occurs on the working group mailing list:
<a href="https://lists.w3.org/Archives/Public/public-linked-json/">[email protected]</a></li>
<li>The working group uses <a href="http://irc.w3.org/?channels=json-ld">#json-ld</a>
IRC channel is available for real-time discussion on <a href="http://irc.w3.org">irc.w3.org</a>.</li>
<li>The <a href="https://webchat.freenode.net/?channels=json-ld">#json-ld</a>
IRC channel is also available for real-time discussion on irc.freenode.net.</li>
</ul>
</section>
<!--section class="informative">
<h2>Typographical conventions</h2>
<div data-include="common/typographical-conventions.html"></div>
</section>
<section class="informative">
<h2>Terminology</h2>
<p>This document uses the following terms as defined in external specifications
and defines terms specific to JSON-LD.</p>
<div data-include="common/terms.html"
data-oninclude="restrictReferences">
</div>
</section-->
<section class="informative">
<h2>Design Goals and Rationale</h2>
<p>CBOR-LD satisfies the following design goals:</p>
<dl>
<dt>Simplicity</dt>
<dd>
Implementations should be simple to implement given an existing JSON-LD
implementation.
</dd>
<dt>Efficient Storage</dt>
<dd>
The encoding process should generate an aggressively compact Linked Data binary
format.
</dd>
<dt>Generalized Algorithm</dt>
<dd>
The encoding algorithm must be generalized.
</dd>
<dt>Semantic Compression</dt>
<dd>
The encoding format should maximize compression of Linked Data URLs (terms and
values). Focusing here ensures that the algorithms can achieve compression
ratios better than generalized compression algorithms.
</dd>
<dt>Raw Binary</dt>
<dd>
Base-encoded binary values, and other compressible data types, should be
translated to their raw binary forms from base-encoded formats when possible
without sacrificing generality.
</dd>
</dl>
<p>
Similarly, the following are non-goals.
</p>
<ul>
<li>
Theoretical purity.
</li>
<li>
Creating new compaction/expansion algorithms specifically for CBOR-LD.
</li>
<li>
Large centralized registries for every term on the planet.
</li>
<li>
Data formats that require large spec changes or complex implementations to
roundtrip from JSON-LD to CBOR-LD and back.
</li>
</ul>
<p>
The following minefields have been identified while working on this
specification:
</p>
<ul>
<li>
While it is widely believed that hashing is fast, it's slower than string
comparison over a small set of strings. This is true because in order to hash,
you must consume the entire string. If you are performing string comparisons,
you can abort the second the byte-for-byte comparison fails. That is, when
processing two values, string comparison can abort processing and hashing
cannot. While most globally collision-resistant hashes are 256-bits, 32 byte
values are large and we can do better in many cases without sacrificing
collision resistance (which hashing algorithms like blake2b-8 cannot do).
</li>
<li>
Anything that requires you to pre-process the JSON-LD data is a non-starter --
it's expensive, and that means that you are encoding semantics in the data.
While this can lead to better compression in some cases, it increases the
complexity of the processors without providing an acceptable return on
investment.
</li>
<li>
Scoped contexts are the most challenging aspect of a more generalized solution.
The deeper the algorithm has to understand scoping, the more combinatorial the
problem becomes and thus the more possible compression values there are, which
harms compression size. The trick is to leverage the determinism in the existing
JSON-LD Processing algorithms and take shortcuts only when it won't affect
JSON-LD processing.
</li>
</ul>
</section>
</section>
<section class="informative">
<h1>Basic Concept</h1>
<p>
The general CBOR-LD encoding algorithm takes a JSON-LD Document and does
the following:
</p>
<ul>
<li>
Determine if JSON-LD can be compressed (@context values in JSON-LD document that
reference contexts via URLs - embedded context values cannot be compressed)
</li>
<li>
Process a JSON-LD Context, building a CBOR-LD term codec map -- a list
of all terms that can be compressed (and whether or not their values can be
compressed). Sort the list. Associate byte values with each term starting at 0
and counting up.
</li>
<li>
Encoding the JSON-LD Document as CBOR-LD consists of replacing every key with
the byte value associated with the term. For every value that is `"@type":
"@id"`, replace the value with the byte value associated with the term.
</li>
<li>
Decoding the CBOR-LD Bytes as JSON-LD consists of replacing every CBOR key with
the associated value in the term codec map. For every value that is
`"@type": "@id"`, replace the value with the byte value associated with the
term.
</li>
</ul>
</section>
<section class="normative">
<h1>CBOR Tags for CBOR-LD</h1>
<p>
The first step in decoding a CBOR-LD payload is to recreate the term codec
map that was used to encode it by processing the contexts in the payload. However,
the contexts needed to create the term codec map can have their URLs encoded as integers
by CBOR-LD. If a CBOR-LD payload contains context URLs compressed in such a way, the
consumer of the CBOR-LD needs to know what compression tables (maps from JSON-LD terms to integers)
were used to compress the context URLs during creation to be able to reconstruct the term codec
map. The following sections define the exact mechanism by which this can be accomplished, allowing
an arbitrary CBOR-LD consumer to decompress any CBOR-LD payload that conforms to this specification.
</p>
<p>
To this end, we have registered the range of CBOR tags 1536-1791** (0x0600-0x06FF) to be used for CBOR-LD,
where data that includes tag value is used to lookup what compression table(s) are needed
to decompress the CBOR-LD context URLs.
</p>
<p class="issue">
This exact range of tag values has not yet been officially registered with
<a href="https://www.iana.org/assignments/cbor-tags/cbor-tags.xhtml">the IANA CBOR
Tag Registry</a>. The exact range is subject to change.
</p>
<section>
<h2>CBOR-LD Varint</h2>
<p>
To enable unbounded extension on possible use cases for CBOR-LD that require different
compression table material for consumption while working within a fixed number of
CBOR tag values, we define the following.
</p>
<p>
Implementers MUST interpret the last byte of the two-byte CBOR tag value on a CBOR-LD payload
as the beginning of a varint. If the CBOR tag is in the range `0x0600`–`0x067F`, the last byte of
the CBOR tag is a one-byte varint, and the tagged item MUST be a map containing the encoded
JSON-LD. If the CBOR tag is `0x0680` or greater, the tagged item MUST be an array containing
two elements. The first item in the array MUST be a major type 2 byte string containing the
rest of the varint, and the second item in the array MUST be a map containing the
encoded JSON-LD. See Algorithm <a
href="#get-varint-structure-algorithm"></a> for
more information.
</p>
<p>
The value of this varint is then used to lookup a <b>CBOR-LD Varint Registry Entry</b> in the
<b>CBOR-LD Varint Registry</b>.
</p>
</section>
<section>
<h2>CBOR-LD Varint Registry</h2>
<p>
The <b>CBOR-LD Registry</b> is a global list that provides
consumers of CBOR-LD payloads the information they need to reconstruct the term codec map
required for decompression. A <b>CBOR-LD Varint Registry Entry</b> contains the following:
<ol>
<li>
Registry Entry ID: a positive integer.
</li>
<li>
Use Case: what type of CBOR-LD payload this entry is used for.
</li>
<li>
`typeTables`: an array containing what `Type Tables` are to be used for this
type of payload.
</li>
<li>
`processingModel`: what processing model is used for this registry entry. A processing model
specifies how auto-generated CBOR-LD values are created from JSON-LD contexts as well as what
type encoders are used alongside the `Type Tables` (e.g. how to partially compress an
`xsd:dateTime` value that does not appear in `Type Table`). The default processing model,
which will be defined later in this specification, will be used unless otherwise specified
in the Registry Entry.
</li>
<li>
Provisional: a yes/no flag indicating whether the entry is provisional. Provisional entries
may change or be removed.
</li>
</ol>
</p>
<p>
The `typeTables` associated with a <b>CBOR-LD Varint Registry Entry</b> MUST be an array of
or JSON objects. The only exception is the string "callerProvidedTable", which may appear in this array,
denoting that for this use case, a `Type Table` is required which is not globally
defined.
</p>
<p></p>
Dereferencing one of these URLs MUST result in a JSON object with the following properties:
<ol>
<li>
`type`: a JSON-LD type.
</li>
<li>
`table`: a JSON object that maps values of the above type to integers.
</li>
</ol>
<p>
If a JSON object is present in the `typeTables` array, it MUST be in the above format.
</p>
<section>
<h3>Registry</h3>
</section>
<p>
The following is the current CBOR-LD registry:
</p>
<table class="simple">
<thead>
<tr>
<th>Registry Entry Id</th>
<th>Use Case</th>
<th>typeTables</th>
<th>Processing Model</th>
<th>Provisional</th>
</tr>
</thead>
<tbody>
<tr>
<td>0</td>
<td>Uncompressed CBORLD</td>
<td>None</td>
<td>DEFAULT</td>
<td>No</td>
</tr>
<tr>
<td>1</td>
<td>Compressed CBORLD, default use case.</td>
<td>DEFAULT</td>
<td>DEFAULT</td>
<td>No</td>
</tr>
<tr>
<td>100</td>
<td><a href='https://w3c-ccg.github.io/vc-barcodes/'>Verifiable Credential Barcodes Specification Test Vectors</a></td>
<td>
[
{
type: "context",
table:
{
"https://www.w3.org/ns/credentials/v2": 32768,
"https://w3id.org/vc-barcodes/v1": 32769,
"https://w3id.org/utopia/v2": 32770
}
},
{
type: "https://w3id.org/security#cryptosuiteString",
table:
{
"ecdsa-rdfc-2019": 1,
"ecdsa-sd-2023": 2,
"eddsa-rdfc-2022": 3,
"ecdsa-xi-2023": 4
}
}
]
</td>
<td>DEFAULT</td>
<td>Yes</td>
</tr>
<tr>
<td>10001</td>
<td>Provisional California DMV Credentials</td>
<td>
[
{
type: "context",
table:
{
"https://www.w3.org/ns/credentials/v2": 1,
"https://w3id.org/vc-barcodes/v1": 2,
"https://w3id.org/vc-dpp/v1rc1": 3,
"https://w3id.org/vdl/v1": 4
}
},
{
type: "https://w3id.org/security#cryptosuiteString",
table:
{
"ecdsa-rdfc-2019": 1
}
},
{
type: "url",
table:
{
"did:key:zDnaeW9VZZs7NH1ykvS5EMFmdodu2wj4dPcrV3DzTAadrXJee": 1,
"did:key:zDnaeW9VZZs7NH1ykvS5EMFmdodu2wj4dPcrV3DzTAadrXJee#zDnaeW9VZZs7NH1ykvS5EMFmdodu2wj4dPcrV3DzTAadrXJee": 2,
"https://dmv.ca.gov/statuses/12345/status-lists": 3
}
}
]
</td>
<td>DEFAULT</td>
<td>Yes</td>
</tr>
<tr>
<td>10002</td>
<td>Provisional First Responder SAP Credentials</td>
<td>
[
{
type: "context",
table:
{
"https://www.w3.org/ns/credentials/v2": 1,
"https://w3id.org/vc-barcodes/v1": 2,
"https://w3id.org/first-responder/sap/v1rc1": 3,
}
},
{
type: "https://w3id.org/security#cryptosuiteString",
table:
{
"ecdsa-rdfc-2019": 1
}
},
{
type: "url",
table:
{
"did:key:zDnaeW9VZZs7NH1ykvS5EMFmdodu2wj4dPcrV3DzTAadrXJee": 1,
"did:key:zDnaeW9VZZs7NH1ykvS5EMFmdodu2wj4dPcrV3DzTAadrXJee#zDnaeW9VZZs7NH1ykvS5EMFmdodu2wj4dPcrV3DzTAadrXJee": 2,
"https://caloes.ca.gov/statuses/12345/status-lists": 3
}
}
]
</td>
<td>DEFAULT</td>
<td>Yes</td>
</tr>
</tbody>
</table>
</section>
</section>
<section class="normative">
<h1>Algorithms</h1>
In this section, we specify the algorithms required to convert JSON-LD to CBOR-LD
and vice versa. We provide first the context processing algorithms, which are required
for both decompression and compression; we then provide the mode-specific algorithms.
<section>
<h2>Encoding and Decoding</h2>
<section>
<h3>JSON-LD to CBOR-LD Compression Algorithm</h3>
<p>
This algorithm takes a map `typeTable`, an integer `registryEntryId`, and a JSON-LD
document `jsonldDocument` as inputs, and returns a hexadecimal string `cborldBytes`.
</p>
<ol>
<li>
Set `prefix` to the result of passing `registryEntryId` to
<a href="#get-varint-structure-algorithm"></a>.
</li>
<li>
Set `state` to an empty map.
</li>
<li>
Set `state.strategy` to "compression".
</li>
<li>
Set `state.typeTable` to `typeTable`.
</li>
<li>
Set `state.registryEntryId` to `registryEntryId`.
</li>
<li>
Set `state` to the result of passing `state` to
<a href="#initialize-conversion-algorithm"></a>.
</li>
<li>
Set `output` to the result of passing `state` and `jsonldDocument`
as `inputDocument` to <a href="#convert-document-algorithm"></a>.
</li>
<li>
Set `suffix` to the CBOR encoding of `output`.
</li>
<li>
Set `cborldBytes` to a hexidecimal encoding of `prefix` prepended to `suffix`.
</li>
<li>
Return `cborldBytes`.
</li>
</ol>
</section>
<section>
<h3>CBOR-LD to JSON-LD Decompression Algorithm</h3>
<p>
This algorithm takes a CBOR-LD payload `cborldBytes`, and returns a JSON-LD document `jsonldDocument`.
</p>
<ol>
<li>
Set `result` to the result of passing `registryEntryId` and `cborldBytes` to
<a href="#get-varint-structure-algorithm"></a>.
</li>
<li>
Set `state`.`registryEntryId` to `result`.`registryEntryId` and `suffix` to `result`.`suffix`.
</li>
<li>
Set `state` to an empty map.
</li>
<li>
Set `state.strategy` to "decompression".
</li>
<li>
For each entry <em>`type`: `map`</em> in the `typeTables` array in the CBOR-LD Varint Registry Entry
associated with `registryEntryId`, add that entry to `state`.`typeTable`, and set the value of `type`
in `state`.`reverseTypeTable` to `inverseMap`, where `inverseMap` is `map` with the mapping inverted.
</li>
<li>
Set `state` to the result of passing `state` to
<a href="#initialize-conversion-algorithm"></a>.
</li>
<li>
Set `input` to the result of decoding `suffix` from bytes to a map.
</li>
<li>
Set `jsonldDocument` to the result of passing `state` and `input` as `inputDocuments`
to <a href="#convert-document-algorithm"></a>.
</li>
<li>
Return `jsonldDocument`.
</li>
</ol>
</section>
</section>
<section>
<h2>Conversion Algorithms</h2>
<p>
The algorithms in this section describe the behavior of a "converter" for abstractly
converting inputs between data forms. When used in conjunction with a "strategy",
such as the "compression" and "decompression" strategies defined later in this section,
these algorithms can be instantiated to convert between concrete data forms. The
"compression" strategy converts from JSON-LD to CBOR-LD, while the "decompression"
strategy converts from CBOR-LD to JSON-LD.
</p>
<section>
<h3>Initialize Conversion Algorithm</h3>
<p>
This algorithm takes and returns a map `state`.
</p>
<ol>
<li>
Set `state` to the result of passing `state` to
<a href="#initialize-context-loader-algorithm"></a>.
</li>
<li>
Set `state.initialActiveContext` to the result of passing empty maps `termMap` and
`previousActiveContext` to <a href="#initialize-active-context-algorithm"></a>.
</li>
<li>
Set `state.typesEncodedAsBytes` to an empty set.
</li>
<li>
Add "none", "http://www.w3.org/2001/XMLSchema#date", "http://www.w3.org/2001/XMLSchema#dateTime",
and "url" to `state.typesEncodedAsBytes`.
</li>
<li>
Return `state`.
</li>
</ol>
</section>
<section>
<h3>Convert Document Algorithm</h3>
<p>
This algorithm takes a map `state` and a map or array of
maps `inputDocuments`, and returns a map containing a map `state` and a map or
array of maps `outputMaps`.
</p>
<ol>
<li>
If `inputDocuments` is an array, set `inputs` to `inputDocuments`. Otherwise, set `inputs`
to `[inputDocuments]`.
</li>
<li>
Set `outputMaps` to an empty array.
</li>
<li>
For `input` in `inputs`:
<ol>
<li>
Set `output` to an empty map.
</li>
<li>
Set `result` to the result of passing `state`, `input`, `output`, and
`state.initialActiveContext` as `activeContext` to
<a href="#general-conversion-algorithm"></a>.
</li>
<li>
Add `result.output` to `outputMaps`.
</li>
<li>
Set `state` to `result.state`.
</li>
</ol>
</li>
<li>
If `inputDocuments` is an array, return `outputMaps`. Otherwise, return the
first element of `outputMaps`.
</li>
</ol>
</section>
<section>
<h3>General Conversion Algorithm</h3>
<p>
This algorithm takes maps `input`, `output`, `state`, and `activeContext`
as inputs, and returns a map containing maps `state` and `output`.
</p>
<ol>
<li>
If `state.strategy` is set to "compression":
<ol>
<li>
Set `contextConversionResult` to the result of
<a href="#convert-contexts-for-compression-algorithm"></a>, passing
`state`, `activeContext`, `input`, and `output`.
</li>
<li>
Set `activeContext` to `contextConversionResult.activeContext`, `output`
to `contextConversionResult.output`, and `state` to `contextConversionResult.state`.
</li>
</ol>
</li>
<li>
Otherwise, set `activeContext` to
`result.activeContext` and `state` to `result.state` of `result` resulting from
<a href="#convert-contexts-for-decompression-algorithm"></a>, passing `state`,
`activeContext`, `input`, and `output`.
</li>
<li>
If `state.strategy` is set to "compression", set `state` to `result.state` and
`objectTypes` to `result.objectTypes` for `result` resulting from
<a href="#get-object-types-for-compression-algorithm"></a>, passing `state`,
`activeContext`, `input`, and `output`.
</li>
<li>
Otherwise, set `state` to `result.state` and `objectTypes` to `result.objectTypes`
for `result` resulting from <a href="#get-object-types-for-decompression-algorithm"></a>,
passing `state`, `activeContext`, `input`, and `output`.
</li>
<li>
Set `activeContext` to the result of passing `activeContext` and `objectTypes` to
<a href="#apply-type-scoped-contexts-algorithm"></a>.
</li>
<li>
If `state.strategy` is set to "compression", set `state` to `result.state` and
`termEntries` to `result.termEntries` for `result` resulting from
<a href="#get-input-entries-for-compression-algorithm"></a>, passing `state`,
`input`, and `activeContext`.
</li>
<li>
Otherwise, set `state` to `result.state`, `output` to `result.output`,
and `termEntries` to `result.termEntries` for `result` resulting from
<a href="#get-input-entries-for-decompression-algorithm"></a>,
passing `state`, `input`, output, and `activeContext`.
</li>
<li>
For `[termInfo, value]` in `termEntries`:
<ol>
<li>
Set `term` to `termInfo.term`.
</li>
<li>
Set `valueActiveContext` to the result of passing `activeContext` and `term` to
<a href="#apply-property-scoped-contexts-algorithm"></a>.
</li>
<li>
Set `plural` to the value of `termInfo.plural` and `termType` to the value of `@type`
in `termInfo.def`.
</li>
<li>
If `plural` is set to `true`, set `values` to the value of `value`. Otherwise, set `values` to
an array containing the value of `value` as a single element.
</li>
<li>
Set `outputs` to an empty array.
</li>
<li>
For `unconvertedValue` in `values`:
<ol>
<li>
Set `result` to the result of <a href="#convert-value-algorithm"></a>,
passing `state`, `termType`, `unconvertedValue` as `value`, and `valueActiveContext`
as `activeContext`.
</li>
<li>
Set `state` to `result.state` and add `result.output` to `outputs`.
</li>
</ol>
</li>
<li>
If `plural` is set to `true`, set `outputValues` to `outputs`. Otherwise, set `outputValues`
to the first element of `outputs`.
</li>
<li>
If `state.strategy` is set to "compression", set the value of `termInfo.termId` to map to
`outputValues` in `output`. Otherwise, set the value of `termInfo.term` to map to `outputValues`
in `output`.
</li>
</ol>
</li>
<li>
Set `result` to be an empty map.
</li>
<li>
Set `result.state` to `state` and `result.output` to `output`.
</li>
<li>
Return `result`.
</li>
</ol>
</section>
<section>
<h3>Convert Value Algorithm</h3>
<p>
This algorithm takes maps `state`, `activeContext`, `termInfo`, and values `value` and `termType`.
It returns a `result` object containing maps `state` and `output`.
</p>
<ol>
<li>
If `value` is `null`, return `null`.
</li>
<li>
If `state`.`strategy` is set to "compression", set `output` to the result of passing `state`, `termType`,
`termInfo`, and `value` to <a href="#convert-value-for-compression-algorithm"></a>.
</li>
<li>
Otherwise, set `output` to the result of passing `state`, `termType`,
`termInfo`, and `value` to <a href="#convert-value-for-decompression-algorithm"></a>.
</li>
<li>
If `output` is defined, return `result`, a map contatining `state` and `output`.
</li>
<li>
If `value` is an array:
<ol>
<li>
Set `outputs` to be an empty array.
</li>
<li>
For `element` of `value`:
<ol>
<li>
Let `result` be the result of <a href="#convert-value-algorithm"></a>, passing `activeContext`, `state`,
`termInfo`, `termType`, and `element` as `value`. Set `state` to `result`.`state` and add `result`.`output`
to `outputs`.
</li>
</ol>
</li>
<li>
Set `result` to be an empty map. Set `result`.`state` to `state` and `result`.`output` to `outputs`.
</li>
<li>
Return `result`.
</li>
</ol>
</li>
<li>
Set `output` to an empty map.
</li>
<li>
Set `result` to the result of <a href="#general-conversion-algorithm"></a>, passing `state`,