-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathindex.cjs
444 lines (365 loc) · 11.9 KB
/
index.cjs
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
'use strict';
var jsonld = require('jsonld');
var ethers = require('ethers');
var uuid = require('uuid');
var merkletreejs = require('merkletreejs');
var N3 = require('n3');
const DEFAULT_CANON_ALGORITHM = 'URDNA2015';
const DEFAULT_RDF_FORMAT = 'application/n-quads';
const PRIVATE_ASSERTION_PREDICATE = 'https://ontology.origintrail.io/dkg/1.0#privateAssertionID';
function arraifyKeccak256(data) {
let bytesLikeData = data;
if (!ethers.utils.isBytesLike(data)) {
bytesLikeData = ethers.utils.toUtf8Bytes(data);
}
return ethers.utils.keccak256(bytesLikeData);
}
async function formatAssertion(json, inputFormat) {
const options = {
algorithm: DEFAULT_CANON_ALGORITHM,
format: DEFAULT_RDF_FORMAT,
};
if (inputFormat) {
options.inputFormat = inputFormat;
}
const canonizedJson = await jsonld.canonize(json, options);
const assertion = canonizedJson.split("\n").filter((x) => x !== "");
if (assertion && assertion.length === 0) {
throw Error("File format is corrupted, no n-quads are extracted.");
}
return assertion;
}
function getAssertionSizeInBytes(assertion) {
const jsonString = JSON.stringify(assertion);
const encoder = new TextEncoder();
const encodedBytes = encoder.encode(jsonString);
return encodedBytes.length;
}
function getAssertionTriplesNumber(assertion) {
return assertion.length;
}
function getAssertionChunksNumber(assertion) {
return assertion.length;
}
async function calculateRoot(assertion) {
assertion.sort();
const leaves = assertion.map((element, index) =>
arraifyKeccak256(
ethers.utils.solidityPack(
["bytes32", "uint256"],
[arraifyKeccak256(element), index]
)
)
);
const tree = new merkletreejs.MerkleTree(leaves, arraifyKeccak256, { sortPairs: true });
return `0x${tree.getRoot().toString("hex")}`;
}
function getMerkleProof(nquadsArray, challenge) {
nquadsArray.sort();
const leaves = nquadsArray.map((element, index) =>
arraifyKeccak256(
ethers.utils.solidityPack(
["bytes32", "uint256"],
[arraifyKeccak256(element), index]
)
)
);
const tree = new merkletreejs.MerkleTree(leaves, arraifyKeccak256, { sortPairs: true });
return {
leaf: arraifyKeccak256(nquadsArray[challenge]),
proof: tree.getHexProof(leaves[challenge]),
};
}
function isEmptyObject$1(obj) {
return Object.keys(obj).length === 0 && obj.constructor === Object;
}
async function formatGraph(content) {
let privateAssertion;
if (content.private && !isEmptyObject$1(content.private)) {
privateAssertion = await formatAssertion(content.private);
}
const publicGraph = {
"@graph": [
content.public && !isEmptyObject$1(content.public) ? content.public : null,
content.private && !isEmptyObject$1(content.private)
? {
[PRIVATE_ASSERTION_PREDICATE]: privateAssertion
? calculateRoot(privateAssertion)
: null,
}
: null,
],
};
const publicAssertion = await formatAssertion(publicGraph);
const result = {
public: publicAssertion,
};
if (privateAssertion) {
result.private = privateAssertion;
}
return result;
}
function generateNamedNode() {
return `uuid:${uuid.v4()}`;
}
var knowledgeAssetTools = /*#__PURE__*/Object.freeze({
__proto__: null,
calculateRoot: calculateRoot,
formatAssertion: formatAssertion,
formatGraph: formatGraph,
generateNamedNode: generateNamedNode,
getAssertionChunksNumber: getAssertionChunksNumber,
getAssertionSizeInBytes: getAssertionSizeInBytes,
getAssertionTriplesNumber: getAssertionTriplesNumber,
getMerkleProof: getMerkleProof
});
async function formatDataset(
json,
inputFormat,
outputFormat = DEFAULT_RDF_FORMAT,
algorithm = DEFAULT_CANON_ALGORITHM
) {
const options = {
algorithm,
format: outputFormat,
};
if (inputFormat) {
options.inputFormat = inputFormat;
}
let privateAssertion;
if (json.private && !isEmptyObject(json.private)) {
const privateCanonizedJson = await jsonld.canonize(json.private, options);
privateAssertion = privateCanonizedJson.split("\n").filter((x) => x !== "");
} else if (!json.public) {
json = { public: json };
}
const publicCanonizedJson = await jsonld.canonize(json.public, options);
const publicAssertion = publicCanonizedJson
.split("\n")
.filter((x) => x !== "");
if (
publicAssertion &&
publicAssertion.length === 0 &&
privateAssertion &&
privateAssertion?.length === 0
) {
throw Error("File format is corrupted, no n-quads are extracted.");
}
const dataset = { public: publicAssertion };
if (privateAssertion) {
dataset.private = privateAssertion;
}
return dataset;
}
function calculateByteSize(string) {
if (typeof string !== "string") {
throw Error(`Size can only be calculated for the 'string' objects.`);
}
const encoder = new TextEncoder();
const encodedBytes = encoder.encode(string);
return encodedBytes.length;
}
function calculateNumberOfChunks(quads, chunkSizeBytes = 32) {
const encoder = new TextEncoder();
const concatenatedQuads = quads.join("\n");
const totalSizeBytes = encoder.encode(concatenatedQuads).length;
return Math.ceil(totalSizeBytes / chunkSizeBytes);
}
function splitIntoChunks(quads, chunkSizeBytes = 32) {
const encoder = new TextEncoder();
const concatenatedQuads = quads.join("\n");
const encodedBytes = encoder.encode(concatenatedQuads);
const chunks = [];
let start = 0;
while (start < encodedBytes.length) {
const end = Math.min(start + chunkSizeBytes, encodedBytes.length);
const chunk = encodedBytes.slice(start, end);
chunks.push(Buffer.from(chunk).toString("utf-8"));
start = end;
}
return chunks;
}
function calculateMerkleRoot(quads, chunkSizeBytes = 32) {
const chunks = splitIntoChunks(quads, chunkSizeBytes);
let leaves = chunks.map((chunk, index) =>
Buffer.from(
ethers.utils
.solidityKeccak256(["string", "uint256"], [chunk, index])
.replace("0x", ""),
"hex"
)
);
while (leaves.length > 1) {
const nextLevel = [];
for (let i = 0; i < leaves.length; i += 2) {
const left = leaves[i];
if (i + 1 >= leaves.length) {
nextLevel.push(left);
break;
}
const right = leaves[i + 1];
const combined = [left, right];
combined.sort(Buffer.compare);
const hash = Buffer.from(
ethers.utils.keccak256(Buffer.concat(combined)).replace("0x", ""),
"hex"
);
nextLevel.push(hash);
}
leaves = nextLevel;
}
return `0x${leaves[0].toString("hex")}`;
}
function calculateMerkleProof(quads, chunkSizeBytes, challenge) {
const chunks = splitIntoChunks(quads, chunkSizeBytes);
const leaves = chunks.map((chunk, index) =>
Buffer.from(
ethers.utils
.solidityKeccak256(["string", "uint256"], [chunk, index])
.replace("0x", ""),
"hex"
)
);
const tree = new merkletreejs.MerkleTree(leaves, arraifyKeccak256, { sortPairs: true });
return {
leaf: arraifyKeccak256(chunks[challenge]),
proof: tree.getHexProof(leaves[challenge]),
};
}
function groupNquadsBySubject(nquadsArray, sort = false) {
const parser = new N3.Parser({ format: "star" });
const grouped = {};
parser.parse(nquadsArray.join("")).forEach((quad) => {
const { subject, predicate, object } = quad;
let subjectKey;
if (subject.termType === "Quad") {
const nestedSubject = subject.subject.value;
const nestedPredicate = subject.predicate.value;
const nestedObject =
subject.object.termType === "Literal"
? `"""${subject.object.value}"""`
: `<${subject.object.value}>`;
subjectKey = `<<<${nestedSubject}> <${nestedPredicate}> ${nestedObject}>>`;
} else {
subjectKey = `<${subject.value}>`;
}
if (!grouped[subjectKey]) {
grouped[subjectKey] = [];
}
const objectValue =
object.termType === "Literal" ? `"""${object.value}"""` : `<${object.value}>`;
const quadString = `${subjectKey} <${predicate.value}> ${objectValue} .`;
grouped[subjectKey].push(quadString);
});
let groupedValues = Object.entries(grouped);
if (sort) {
groupedValues = groupedValues.sort(([keyA], [keyB]) =>
keyA.localeCompare(keyB)
);
}
return groupedValues.map(([, quads]) => quads);
}
function countDistinctSubjects(nquadsArray) {
const parser = new N3.Parser({ format: "star" });
const subjects = new Set();
parser
.parse(nquadsArray.join(""))
.forEach((quad) => subjects.add(quad.subject.value));
return subjects.size;
}
function filterTriplesByAnnotation(
nquadsArray,
annotationPredicate = null,
annotationValue = null,
filterNested = true
) {
const parser = new N3.Parser({ format: "star" });
const filteredTriples = [];
parser.parse(nquadsArray.join("")).forEach((quad) => {
const { subject, predicate, object } = quad;
const isNested = subject.termType === "Quad";
if (filterNested && isNested) {
const nestedSubject = subject.subject.value;
const nestedPredicate = subject.predicate.value;
const nestedObject =
subject.object.termType === "Literal"
? `"${subject.object.value}"`
: `<${subject.object.value}>`;
const matches =
(!annotationPredicate || predicate.value === annotationPredicate) &&
(!annotationValue || object.value === annotationValue);
if (matches) {
filteredTriples.push(
`<${nestedSubject}> <${nestedPredicate}> ${nestedObject}`
);
}
} else if (!filterNested && !isNested) {
const subjectValue = `<${subject.value}>`;
const objectValue =
object.termType === "Literal"
? `"${object.value}"`
: `<${object.value}>`;
const matches =
(!annotationPredicate || predicate.value === annotationPredicate) &&
(!annotationValue || object.value === annotationValue);
if (matches) {
filteredTriples.push(
`${subjectValue} <${predicate.value}> ${objectValue} .`
);
}
}
});
return filteredTriples;
}
function generateMissingIdsForBlankNodes(nquadsArray) {
const parser = new N3.Parser({ format: "star" });
const writer = new N3.Writer({ format: "star" });
const generatedIds = {};
// Function to replace blank nodes in quads and nested RDF-star triples
function replaceBlankNode(term) {
if (term.termType === "BlankNode") {
if (!generatedIds[term.value]) {
generatedIds[term.value] = `uuid:${uuid.v4()}`;
}
return N3.DataFactory.namedNode(generatedIds[term.value]);
}
if (term.termType === "Quad") {
// Recursively handle nested RDF-star triples
return N3.DataFactory.quad(
replaceBlankNode(term.subject),
replaceBlankNode(term.predicate),
replaceBlankNode(term.object)
);
}
return term; // Return IRI or Literal unchanged
}
const updatedNquads = parser.parse(nquadsArray.join("")).map((quad) => {
// Replace blank nodes in the quad
const updatedQuad = N3.DataFactory.quad(
replaceBlankNode(quad.subject),
replaceBlankNode(quad.predicate),
replaceBlankNode(quad.object)
);
// Convert back to string format
return updatedQuad;
});
return writer.quadsToString(updatedNquads).trimEnd().split("\n");
}
function isEmptyObject(obj) {
return Object.keys(obj).length === 0 && obj.constructor === Object;
}
var knowledgeCollectionTools = /*#__PURE__*/Object.freeze({
__proto__: null,
calculateByteSize: calculateByteSize,
calculateMerkleProof: calculateMerkleProof,
calculateMerkleRoot: calculateMerkleRoot,
calculateNumberOfChunks: calculateNumberOfChunks,
countDistinctSubjects: countDistinctSubjects,
filterTriplesByAnnotation: filterTriplesByAnnotation,
formatDataset: formatDataset,
generateMissingIdsForBlankNodes: generateMissingIdsForBlankNodes,
groupNquadsBySubject: groupNquadsBySubject,
splitIntoChunks: splitIntoChunks
});
exports.kaTools = knowledgeAssetTools;
exports.kcTools = knowledgeCollectionTools;