Riskless/static/js/modules/interface/proofs.js
2023-04-13 16:33:32 +01:00

54 lines
1.3 KiB
JavaScript

/**
* CSPRNG Fisher-Yates shuffle.
*
* Only works on lists up to 255 elements.
*/
function cryptoShuffle(l) {
let out = [];
for (let i = l.length - 1; i > 0; i--) {
let value = new Uint8Array([0]);
crypto.getRandomValues(value);
while (value[0] > i) {
crypto.getRandomValues(value);
}
let v = l.splice(value[0], 1);
out.push(v[0]);
}
out.push(l[0]);
return out;
}
window.cryptoShuffle = cryptoShuffle;
function proveRegions(regions) {
// Construct prover coins
let coins = [];
let regionNames = Object.keys(regions);
for (let x = 0; x < 40; x++) {
let psi = cryptoShuffle(structuredClone(regionNames)).join("");
let newRegions = structuredClone(regions);
// rearrange keys
for (let index = 0; index < regionNames.length; index++) {
let c = regions[psi[index]].clone();
// re-blind
c.update(c.pubKey.encrypt(0n));
newRegions[regionNames[index]] = c.toString();
}
coins.push(newRegions);
}
// Construct verifier coins
let hasher = new jsSHA("SHA3-256", "TEXT");
hasher.update(JSON.stringify(coins));
console.log(hasher.getHash("UINT8ARRAY"));
// Construct prover proofs
}
window.proveRegions = proveRegions;