@tideorg/js 0.0.1

package/dist/Cryptide/Serialization.d.ts

@@ -0,0 +1,66 @@
+import { Point } from "./Ed25519";
+export declare function writeInt64LittleEndian(value: bigint): Uint8Array<ArrayBuffer>;
+export declare function readInt64LittleEndian(bytes: Uint8Array): bigint;
+export declare class AuthorizerPack {
+    AuthFlow: any;
+    Authorizer: any;
+    SignModels: any[];
+    constructor(data: Uint8Array);
+}
+export declare class GVRK_Pack {
+    GVRK: any;
+    Expiry: any;
+    constructor(data: Uint8Array);
+    encode(): Uint8Array<ArrayBuffer>;
+}
+export declare function CreateTideMemory(initialValue: Uint8Array, totalLength: number, version?: number): Uint8Array<ArrayBuffer>;
+export declare function CreateTideMemoryFromArray(datas: Uint8Array[]): Uint8Array<ArrayBuffer>;
+export declare function WriteValue(memory: Uint8Array, index: number, value: Uint8Array): void;
+export declare function GetValue(a: Uint8Array, index: number): Uint8Array<ArrayBufferLike>;
+export declare function TryGetValue(a: Uint8Array, index: number, returnObj: any): boolean;
+export declare function DeserializeNetworkKey(data: string): Point;
+export declare function EdPointToJWK(p: Point): Promise<string>;
+export declare function DeserializeTIDE_KEY(key: string, prefix: string): bigint;
+export declare function GetUID(str: string): Promise<string>;
+export declare function BigIntToByteArray(num: bigint): Uint8Array;
+export declare function BigIntFromByteArray(bytes: Uint8Array): bigint;
+export declare function ConcatUint8Arrays(arrays: Uint8Array[]): Uint8Array<ArrayBuffer>;
+export declare function XOR(array1: Uint8Array, array2: Uint8Array): Uint8Array<ArrayBuffer>;
+export declare function PadRight(array: any[], length: number, padding?: any): any[];
+export declare function StringToUint8Array(string: string): Uint8Array<ArrayBuffer>;
+export declare function StringFromUint8Array(bytes: Uint8Array): string;
+export declare class Byte {
+    bits: number[];
+    constructor();
+    /**
+     * Sets a bit at the start of the array (index 0)
+     */
+    setFirstBit(bit: number): void;
+    toUint8Array(): Uint8Array;
+    static fromUint8Array(uint8Array: Uint8Array): Byte;
+    /**
+     * Maximum number of 255
+     */
+    static fromNumber(number: number): Byte;
+}
+export declare function getBytesFromInt16(schemeInt: number): Uint8Array<ArrayBuffer>;
+export declare function numberToUint8Array(num: number, len?: number): Uint8Array<ArrayBuffer>;
+export declare function Uint8ArrayToNumber(byteArray: Uint8Array): number;
+export declare function base64ToBase64Url(base64: string): string;
+export declare function base64UrlToBase64(base64Url: string): string;
+export declare function bitArrayToUint8Array(array: number[]): Uint8Array<ArrayBuffer>;
+/**
+ * Works for .NET functions.
+ */
+export declare function serializeBitArray(bitArray_p: number[]): Uint8Array<ArrayBuffer>;
+export declare function bitArrayAND(bitarray1: (0 | 1)[], bitarray2: (0 | 1)[]): (0 | 1)[];
+/**
+ * Works for .NET functions.
+ */
+export declare function deserializeBitArray(byteArray: Uint8Array): any[];
+export declare function uint8ArrayToBitArray(byteArray: Uint8Array): any[];
+export declare function Hex2Bytes(string: string): Uint8Array;
+export declare function Bytes2Hex(byteArray: Uint8Array): string;
+export declare function bytesToBase64(bytes: Uint8Array): string;
+export declare function base64ToBytes(str: string): Uint8Array;
+//# sourceMappingURL=Serialization.d.ts.map

package/dist/Cryptide/Serialization.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Serialization.d.ts","sourceRoot":"","sources":["../../Cryptide/Serialization.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAO,KAAK,EAAE,MAAM,WAAW,CAAC;AAKvC,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,2BAcnD;AACD,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,UAAU,UActD;AACD,qBAAa,cAAc;IAC1B,QAAQ,EAAE,GAAG,CAAC;IACd,UAAU,EAAE,GAAG,CAAC;IAChB,UAAU,EAAE,GAAG,EAAE,CAAC;gBACN,IAAI,EAAE,UAAU;CAkB5B;AACD,qBAAa,SAAS;IACrB,IAAI,EAAE,GAAG,CAAC;IACV,MAAM,EAAE,GAAG,CAAC;gBACA,IAAI,EAAE,UAAU;IAIzB,MAAM;CAGT;AACD,wBAAgB,gBAAgB,CAAC,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,GAAE,MAAU,2BAuBlG;AACD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,UAAU,EAAE,2BAQ5D;AACD,wBAAgB,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,QAsC9E;AACD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,+BA2CpD;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,WASvE;AAED,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,SAEjD;AAED,wBAAsB,YAAY,CAAC,CAAC,EAAE,KAAK,mBAQ1C;AAED,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,UAM9D;AAED,wBAAsB,MAAM,CAAC,GAAG,EAAE,MAAM,mBAEvC;AAED,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,CAEzD;AAED,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAE7D;AAED,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,UAAU,EAAE,2BASrD;AAED,wBAAgB,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,2BASzD;AACD,wBAAgB,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAE,GAAO,SAKtE;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,2BAGhD;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,UAAU,UAGrD;AAED,qBAAa,IAAI;IAChB,IAAI,EAAE,MAAM,EAAE,CAAM;;IAOpB;;OAEG;IACH,WAAW,CAAC,GAAG,EAAE,MAAM;IAIpB,YAAY,IAAI,UAAU;IAY1B,MAAM,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI;IAOtD;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;CAWvC;AACD,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,2BAQlD;AACD,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,GAAE,MAAW,2BAoB/D;AACD,wBAAgB,kBAAkB,CAAC,SAAS,EAAE,UAAU,UAUvD;AACD,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,UAE/C;AAED,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,UAMlD;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,2BAanD;AACD;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,2BAoBrD;AACD,wBAAgB,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,aAErE;AACD;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,UAAU,SAexD;AACD,wBAAgB,oBAAoB,CAAC,SAAS,EAAE,UAAU,SAczD;AACD,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,CAiBpD;AAED,wBAAgB,SAAS,CAAC,SAAS,EAAE,UAAU,GAAG,MAAM,CAavD;AAoCD,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAoBvD;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,CAyBrD"}

package/dist/Cryptide/Serialization.js

@@ -0,0 +1,517 @@
+// 
+// Tide Protocol - Infrastructure for a TRUE Zero-Trust paradigm
+// Copyright (C) 2022 Tide Foundation Ltd
+// 
+// This program is free software and is subject to the terms of 
+// the Tide Community Open Code License as published by the 
+// Tide Foundation Limited. You may modify it and redistribute 
+// it in accordance with and subject to the terms of that License.
+// This program is distributed WITHOUT WARRANTY of any kind, 
+// including without any implied warranty of MERCHANTABILITY or 
+// FITNESS FOR A PARTICULAR PURPOSE.
+// See the Tide Community Open Code License for more details.
+// You should have received a copy of the Tide Community Open 
+// Code License along with this program.
+// If not, see https://tide.org/licenses_tcoc2-0-0-en
+//
+import { Ed25519PublicComponent } from "./Components/Schemes/Ed25519/Ed25519Components";
+import { etc, Point } from "./Ed25519";
+import { SHA256_Digest } from "./Hashing/Hash";
+import { CreateVRKPackage } from "./TideMemoryObjects";
+export function writeInt64LittleEndian(value) {
+    const INT64_MIN = -9223372036854775808n; // -2^63
+    const INT64_MAX = 9223372036854775807n; // 2^63 - 1
+    if (value < INT64_MIN || value > INT64_MAX) {
+        throw new RangeError("Value is out of range for a 64-bit signed integer.");
+    }
+    const bytes = new Uint8Array(8);
+    for (let i = 0; i < 8; i++) {
+        bytes[i] = Number((value >> BigInt(8 * i)) & 0xffn);
+    }
+    return bytes;
+}
+export function readInt64LittleEndian(bytes) {
+    if (bytes.length !== 8) {
+        throw new Error("Invalid byte array length. Expected 8 bytes.");
+    }
+    let value = 0n;
+    for (let i = 0; i < 8; i++) {
+        value |= BigInt(bytes[i]) << BigInt(8 * i);
+    }
+    // Interpret the value as a signed 64-bit integer
+    value = BigInt.asIntN(64, value);
+    return value;
+}
+export class AuthorizerPack {
+    constructor(data) {
+        // Cross-realm safe check
+        const d = data;
+        const isUint8Like = d && (d instanceof Uint8Array ||
+            (ArrayBuffer.isView(d) && d.constructor?.name === 'Uint8Array') ||
+            (typeof d === 'object' && typeof d.length === 'number' && d.buffer instanceof ArrayBuffer));
+        if (!isUint8Like)
+            throw Error("Data must be byte array");
+        this.AuthFlow = StringFromUint8Array(GetValue(data, 0));
+        this.Authorizer = new GVRK_Pack(GetValue(data, 1));
+        var c = true;
+        var i = 2;
+        this.SignModels = [];
+        while (c) {
+            try {
+                this.SignModels.push(StringFromUint8Array(GetValue(data, i)));
+                i++;
+            }
+            catch {
+                c = false;
+            }
+        }
+    }
+}
+export class GVRK_Pack {
+    constructor(data) {
+        this.GVRK = Ed25519PublicComponent.DeserializeComponent(GetValue(data, 0));
+        this.Expiry = readInt64LittleEndian(GetValue(data, 1)); // we do not allow vrks without expiry on enclave for now
+    }
+    encode() {
+        return CreateVRKPackage(this.GVRK, this.Expiry);
+    }
+}
+export function CreateTideMemory(initialValue, totalLength, version = 1) {
+    if (totalLength < initialValue.length + 4) {
+        throw new Error("Not enough space to allocate requested data. Make sure to request more space in totalLength than length of InitialValue plus 4 bytes for length.");
+    }
+    // Total buffer length is 4 (version) + totalLength
+    const bufferLength = 4 + totalLength;
+    const buffer = new Uint8Array(bufferLength);
+    const dataView = new DataView(buffer.buffer);
+    // Write version at position 0 (4 bytes)
+    dataView.setInt32(0, version, true); // true for little-endian
+    let dataLocationIndex = 4;
+    // Write data length of initialValue at position 4 (4 bytes)
+    dataView.setInt32(dataLocationIndex, initialValue.length, true);
+    dataLocationIndex += 4;
+    // Write initialValue starting from position 8
+    buffer.set(initialValue, dataLocationIndex);
+    return buffer;
+}
+export function CreateTideMemoryFromArray(datas) {
+    if (datas.length == 0)
+        return new Uint8Array();
+    const length = datas.reduce((sum, next) => sum + 4 + next.length, 0);
+    const mem = CreateTideMemory(datas[0], length);
+    for (let i = 1; i < datas.length; i++) {
+        WriteValue(mem, i, datas[i]);
+    }
+    return mem;
+}
+export function WriteValue(memory, index, value) {
+    if (index < 0)
+        throw new Error("Index cannot be less than 0");
+    if (index === 0)
+        throw new Error("Use CreateTideMemory to set value at index 0");
+    if (memory.length < 4 + value.length)
+        throw new Error("Could not write to memory. Memory too small for this value");
+    const dataView = new DataView(memory.buffer);
+    let dataLocationIndex = 4; // Start after the version number
+    // Navigate through existing data segments
+    for (let i = 0; i < index; i++) {
+        if (dataLocationIndex + 4 > memory.length) {
+            throw new RangeError("Index out of range.");
+        }
+        // Read data length at current position
+        const nextDataLength = dataView.getInt32(dataLocationIndex, true);
+        dataLocationIndex += 4;
+        dataLocationIndex += nextDataLength;
+    }
+    // Check if there's enough space to write the value
+    if (dataLocationIndex + 4 + value.length > memory.length) {
+        throw new RangeError("Not enough space to write value");
+    }
+    // Check if data has already been written to this index
+    const existingLength = dataView.getInt32(dataLocationIndex, true);
+    if (existingLength !== 0) {
+        throw new Error("Data has already been written to this index");
+    }
+    // Write data length of value at current position
+    dataView.setInt32(dataLocationIndex, value.length, true);
+    dataLocationIndex += 4;
+    // Write value starting from current position
+    memory.set(value, dataLocationIndex);
+}
+export function GetValue(a, index) {
+    if (!(a instanceof Uint8Array)) {
+        console.error('[GetValue] Invalid input type:', typeof a, 'value:', a);
+        throw new TypeError("Input must be a Uint8Array.");
+    }
+    const buffer = a;
+    if (buffer.length < 4) {
+        throw new Error("Insufficient data to read.");
+    }
+    // Create a DataView for reading integers in little-endian format
+    const dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength);
+    // Optional: Read the version if needed
+    // const version = dataView.getInt32(0, true);
+    let dataLocationIndex = 4;
+    for (let i = 0; i < index; i++) {
+        // Check if there's enough data to read the length of the next segment
+        if (dataLocationIndex + 4 > buffer.length) {
+            throw new RangeError("Index out of range.");
+        }
+        const nextDataLength = dataView.getInt32(dataLocationIndex, true);
+        dataLocationIndex += 4 + nextDataLength;
+    }
+    // Check if there's enough data to read the length of the final segment
+    if (dataLocationIndex + 4 > buffer.length) {
+        throw new RangeError("Index out of range.");
+    }
+    const finalDataLength = dataView.getInt32(dataLocationIndex, true);
+    dataLocationIndex += 4;
+    // Check if the final data segment is within bounds
+    if (dataLocationIndex + finalDataLength > buffer.length) {
+        throw new RangeError("Index out of range.");
+    }
+    return buffer.subarray(dataLocationIndex, dataLocationIndex + finalDataLength);
+}
+export function TryGetValue(a, index, returnObj) {
+    try {
+        returnObj["result"] = GetValue(a, index);
+        return true;
+    }
+    catch {
+        returnObj["result"] = null;
+        return false;
+    }
+}
+export function DeserializeNetworkKey(data) {
+    return Point.fromBytes(Hex2Bytes(data.toLowerCase()));
+}
+export async function EdPointToJWK(p) {
+    return JSON.stringify({
+        "kty": "OKP",
+        "kid": Bytes2Hex(await SHA256_Digest(p.toRawBytes())),
+        "alg": "EdDSA",
+        "crv": "Ed25519",
+        "x": base64ToBase64Url(p.toBase64())
+    });
+}
+export function DeserializeTIDE_KEY(key, prefix) {
+    const header = key.substring(0, 8);
+    const data = base64ToBytes(key.substring(8, key.length));
+    if (header != "tide" + prefix + "key")
+        throw Error("Unexpected header in deserialization");
+    if (data.length != 32)
+        throw Error("Unexpected key length in deserialization");
+    return BigIntFromByteArray(data);
+}
+export async function GetUID(str) {
+    return Bytes2Hex(await SHA256_Digest(str.toLowerCase()));
+}
+export function BigIntToByteArray(num) {
+    return etc.bigIntToBytes(num);
+}
+export function BigIntFromByteArray(bytes) {
+    return etc.bytesToBigInt(bytes);
+}
+export function ConcatUint8Arrays(arrays) {
+    const totalLength = arrays.reduce((sum, next) => next.length + sum, 0);
+    var newArray = new Uint8Array(totalLength);
+    var offset = 0;
+    arrays.forEach(item => {
+        newArray.set(item, offset);
+        offset += item.length;
+    });
+    return newArray;
+}
+export function XOR(array1, array2) {
+    if (array1.length !== array2.length) {
+        throw new Error('Arrays have different lengths, cannot XOR them.');
+    }
+    let result = new Uint8Array(array1.length);
+    for (let i = 0; i < array1.length; i++) {
+        result[i] = array1[i] ^ array2[i];
+    }
+    return result;
+}
+export function PadRight(array, length, padding = 0) {
+    while (array.length < length) {
+        array.push(padding);
+    }
+    return array;
+}
+export function StringToUint8Array(string) {
+    const enc = new TextEncoder();
+    return enc.encode(string);
+}
+export function StringFromUint8Array(bytes) {
+    const decoder = new TextDecoder('utf-8');
+    return decoder.decode(bytes);
+}
+export class Byte {
+    constructor() {
+        this.bits = [];
+        /**
+         * @type {number[]}
+         */
+        this.bits = []; // bits.length should never exceed 8 - hence a byte
+    }
+    /**
+     * Sets a bit at the start of the array (index 0)
+     */
+    setFirstBit(bit) {
+        const b = bit === 0 ? 0 : 1;
+        this.bits[0] = b;
+    }
+    toUint8Array() {
+        let number = 0;
+        for (let i = 0; i < 8; i++) {
+            number += this.bits[i] * Math.pow(2, 7 - i);
+        }
+        const byteArray = new Uint8Array(1); // only 1 byte needed
+        byteArray[0] = number & 255;
+        return byteArray;
+    }
+    static fromUint8Array(uint8Array) {
+        let bitArray = new Byte();
+        for (let i = 7; i >= 0; i--) {
+            bitArray.bits.push((uint8Array[0] >> i) & 1); // only get first byte of byte array
+        }
+        return bitArray;
+    }
+    /**
+     * Maximum number of 255
+     */
+    static fromNumber(number) {
+        if (number < 0 || number > 255) {
+            throw Error("Number must be between 0 and 255"); // Adjusted the range check
+        }
+        let byte = new Byte();
+        let binaryString = number.toString(2).padStart(8, '0'); // Pad the string to ensure 8 bits
+        for (let i = 0; i < 8; i++) {
+            byte.bits.push(binaryString[i] === '1' ? 1 : 0); // Corrected the condition
+        }
+        return byte;
+    }
+}
+export function getBytesFromInt16(schemeInt) {
+    // Create an ArrayBuffer with 2 bytes (16 bits)
+    const buffer = new ArrayBuffer(2);
+    const view = new DataView(buffer);
+    // Write the 16-bit integer to the buffer, little-endian
+    view.setInt16(0, schemeInt, true); // 'true' for little-endian, 'false' for big-endian
+    // Return the bytes as a Uint8Array
+    return new Uint8Array(buffer);
+}
+export function numberToUint8Array(num, len = -1) {
+    if (num < 0 || !Number.isInteger(num)) {
+        throw new Error('Number must be a non-negative integer.');
+    }
+    if (num === 0)
+        return new Uint8Array([0]);
+    let numberOfBytes = Math.ceil(Math.log2(num + 1) / 8);
+    let byteArray = new Uint8Array(numberOfBytes);
+    for (let i = 0; i < numberOfBytes; i++) {
+        byteArray[i] = (num >> (8 * i)) & 0xFF;
+    }
+    if (len == -1)
+        return byteArray;
+    else {
+        const offset = len - byteArray.length;
+        if (offset == 0)
+            return byteArray;
+        const padding = new Uint8Array(offset).fill(0);
+        return ConcatUint8Arrays([byteArray, padding]);
+    }
+}
+export function Uint8ArrayToNumber(byteArray) {
+    if (!(byteArray instanceof Uint8Array)) {
+        throw new Error('Input must be a Uint8Array.');
+    }
+    let num = 0;
+    for (let i = byteArray.length - 1; i >= 0; i--) {
+        num = (num << 8) | byteArray[i];
+    }
+    return num;
+}
+export function base64ToBase64Url(base64) {
+    return base64.replace(/\+/g, '-').replace(/\//g, '_').replace(/=+$/, '');
+}
+export function base64UrlToBase64(base64Url) {
+    let base64 = base64Url.replace(/-/g, '+').replace(/_/g, '/');
+    while (base64.length % 4) {
+        base64 += '=';
+    }
+    return base64;
+}
+export function bitArrayToUint8Array(array) {
+    // Made without ChatGPT (but had some help)
+    const byteArray = new Uint8Array(Math.ceil(array.length / 8));
+    let bitCount = 0;
+    for (let i = 0; i < byteArray.length; i++) {
+        const currentByteLength = array.length - bitCount >= 8 ? 8 : array.length - bitCount;
+        for (let j = 0; j < currentByteLength; j++) {
+            byteArray[i] |= array[bitCount] << (currentByteLength - 1 - j);
+            bitCount++;
+        }
+    }
+    return byteArray;
+}
+/**
+ * Works for .NET functions.
+ */
+export function serializeBitArray(bitArray_p) {
+    // If anyone does a deep dive into this function and notices the bits are reversed, blame .NET's BitArray class.
+    let bitArray = bitArray_p.slice();
+    // Ensure the bit array length is a multiple of 8 by padding if necessary
+    while (bitArray.length % 8 !== 0) {
+        bitArray.push(0);
+    }
+    const byteArray = new Uint8Array(bitArray.length / 8);
+    for (let byteIndex = 0; byteIndex < byteArray.length; byteIndex++) {
+        // For each byte, calculate its value from 8 bits, reversing the bit order
+        let byteValue = 0;
+        for (let bitPosition = 0; bitPosition < 8; bitPosition++) {
+            byteValue |= (bitArray[byteIndex * 8 + bitPosition] << bitPosition);
+        }
+        byteArray[byteIndex] = byteValue;
+    }
+    return byteArray;
+}
+export function bitArrayAND(bitarray1, bitarray2) {
+    return bitarray1.map((b, i) => b == 1 && bitarray2[i] == 1 ? 1 : 0);
+}
+/**
+ * Works for .NET functions.
+ */
+export function deserializeBitArray(byteArray) {
+    const bitArray = [];
+    byteArray.forEach(byte => {
+        for (let bitPosition = 0; bitPosition < 8; bitPosition++) {
+            bitArray.push((byte >> bitPosition) & 1);
+        }
+    });
+    // Remove padding
+    while (bitArray.length > 0 && bitArray[bitArray.length - 1] === 0) {
+        bitArray.pop();
+    }
+    return bitArray;
+}
+export function uint8ArrayToBitArray(byteArray) {
+    // always produces a bitArray of length 20
+    const bitArray = [];
+    let count = 0;
+    for (let i = 0; i < byteArray.length; i++) {
+        for (let j = 7; j >= 0; j--) {
+            // Extract the j-th bit of the i-th byte.
+            const bit = (byteArray[i] >> j) & 1;
+            if (count < 16 || count > 19)
+                bitArray.push(bit); // exclude intermediate bits, always l=20!
+            count++;
+        }
+    }
+    return bitArray;
+}
+export function Hex2Bytes(string) {
+    const hexRegex = /^0x[0-9A-Fa-f]+$|^[0-9A-Fa-f]+$/;
+    if (!hexRegex.test(string))
+        throw Error("Invalid Hex");
+    const normal = string.length % 2 ? "0" + string : string; // Make even length
+    const bytes = new Uint8Array(normal.length / 2);
+    for (let index = 0; index < bytes.length; ++index) {
+        const c1 = normal.charCodeAt(index * 2);
+        const c2 = normal.charCodeAt(index * 2 + 1);
+        const n1 = c1 - (c1 < 58 ? 48 : (c1 < 97 ? 55 : 87));
+        const n2 = c2 - (c2 < 58 ? 48 : (c2 < 97 ? 55 : 87));
+        bytes[index] = n1 * 16 + n2;
+    }
+    return bytes;
+}
+export function Bytes2Hex(byteArray) {
+    const chars = new Uint8Array(byteArray.length * 2);
+    const alpha = 'a'.charCodeAt(0) - 10;
+    const digit = '0'.charCodeAt(0);
+    let p = 0;
+    for (let i = 0; i < byteArray.length; i++) {
+        let nibble = byteArray[i] >>> 4;
+        chars[p++] = nibble > 9 ? nibble + alpha : nibble + digit;
+        nibble = byteArray[i] & 0xF;
+        chars[p++] = nibble > 9 ? nibble + alpha : nibble + digit;
+    }
+    return String.fromCharCode.apply(null, Array.from(chars));
+}
+/**
+ * Credits to Egor Nepomnyaschih for the below code
+ * Link: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727
+*/
+const base64abc = [
+    "A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M",
+    "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z",
+    "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m",
+    "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z",
+    "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "+", "/"
+];
+const base64codes = [
+    255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
+    255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
+    255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 62, 255, 255, 255, 63,
+    52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 255, 255, 255, 0, 255, 255,
+    255, 0, 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, 255, 255, 255, 255, 255,
+    255, 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
+];
+function getBase64Code(charCode) {
+    if (charCode >= base64codes.length) {
+        throw new Error("Unable to parse base64 string.");
+    }
+    const code = base64codes[charCode];
+    if (code === 255) {
+        throw new Error("Unable to parse base64 string.");
+    }
+    return code;
+}
+export function bytesToBase64(bytes) {
+    let result = '', i, l = bytes.length;
+    for (i = 2; i < l; i += 3) {
+        result += base64abc[bytes[i - 2] >> 2];
+        result += base64abc[((bytes[i - 2] & 0x03) << 4) | (bytes[i - 1] >> 4)];
+        result += base64abc[((bytes[i - 1] & 0x0F) << 2) | (bytes[i] >> 6)];
+        result += base64abc[bytes[i] & 0x3F];
+    }
+    if (i === l + 1) { // 1 octet yet to write
+        result += base64abc[bytes[i - 2] >> 2];
+        result += base64abc[(bytes[i - 2] & 0x03) << 4];
+        result += "==";
+    }
+    if (i === l) { // 2 octets yet to write
+        result += base64abc[bytes[i - 2] >> 2];
+        result += base64abc[((bytes[i - 2] & 0x03) << 4) | (bytes[i - 1] >> 4)];
+        result += base64abc[(bytes[i - 1] & 0x0F) << 2];
+        result += "=";
+    }
+    return result;
+}
+export function base64ToBytes(str) {
+    const base64Regex = /^(?:[A-Za-z0-9+\/]{4})*(?:[A-Za-z0-9+\/]{2}==|[A-Za-z0-9+\/]{3}=)?$/;
+    if (!base64Regex.test(str))
+        throw Error("Not valid base64");
+    if (str.length % 4 !== 0) {
+        throw new Error("Unable to parse base64 string.");
+    }
+    const index = str.indexOf("=");
+    if (index !== -1 && index < str.length - 2) {
+        throw new Error("Unable to parse base64 string.");
+    }
+    let missingOctets = str.endsWith("==") ? 2 : str.endsWith("=") ? 1 : 0, n = str.length, result = new Uint8Array(3 * (n / 4)), buffer;
+    for (let i = 0, j = 0; i < n; i += 4, j += 3) {
+        buffer =
+            getBase64Code(str.charCodeAt(i)) << 18 |
+                getBase64Code(str.charCodeAt(i + 1)) << 12 |
+                getBase64Code(str.charCodeAt(i + 2)) << 6 |
+                getBase64Code(str.charCodeAt(i + 3));
+        result[j] = buffer >> 16;
+        result[j + 1] = (buffer >> 8) & 0xFF;
+        result[j + 2] = buffer & 0xFF;
+    }
+    return result.subarray(0, result.length - missingOctets);
+}
+// Custom extensions

package/dist/Cryptide/Signing/BlindSig.d.ts

@@ -0,0 +1,10 @@
+import { Point } from "../Ed25519";
+export declare function genBlindMessage(gR: Point, pub: Point, message: Uint8Array, multiplier: bigint): Promise<{
+    blurHCMKMul: bigint;
+    blur: bigint;
+    gRMul: Point;
+}>;
+export declare function unblindSignature(blindS: bigint, blur: bigint): Promise<bigint>;
+export declare function verifyBlindSignature(S: bigint, noncePublic: Point, pub: Point, message: Uint8Array): Promise<boolean>;
+export declare function serializeBlindSig(S: bigint, noncePublic: Point): Uint8Array<ArrayBuffer>;
+//# sourceMappingURL=BlindSig.d.ts.map

package/dist/Cryptide/Signing/BlindSig.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BlindSig.d.ts","sourceRoot":"","sources":["../../../Cryptide/Signing/BlindSig.ts"],"names":[],"mappings":"AAkBA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAInC,wBAAsB,eAAe,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM;;;;GAOnG;AACD,wBAAsB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,mBAGlE;AAED,wBAAsB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,oBAOxG;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,2BAE9D"}

package/dist/Cryptide/Signing/BlindSig.js

@@ -0,0 +1,41 @@
+// 
+// Tide Protocol - Infrastructure for a TRUE Zero-Trust paradigm
+// Copyright (C) 2022 Tide Foundation Ltd
+// 
+// This program is free software and is subject to the terms of 
+// the Tide Community Open Code License as published by the 
+// Tide Foundation Limited. You may modify it and redistribute 
+// it in accordance with and subject to the terms of that License.
+// This program is distributed WITHOUT WARRANTY of any kind, 
+// including without any implied warranty of MERCHANTABILITY or 
+// FITNESS FOR A PARTICULAR PURPOSE.
+// See the Tide Community Open Code License for more details.
+// You should have received a copy of the Tide Community Open 
+// Code License along with this program.
+// If not, see https://tide.org/licenses_tcoc2-0-0-en
+//
+import { RandomBigInt, mod, mod_inv } from "../Math";
+import { SHA512_Digest } from "../Hashing/Hash";
+import { BigIntFromByteArray, BigIntToByteArray, ConcatUint8Arrays, bytesToBase64 } from "../Serialization";
+import * as EdDSA from "./EdDSA";
+export async function genBlindMessage(gR, pub, message, multiplier) {
+    const blur = RandomBigInt();
+    const gRMul = gR.mul(mod_inv(blur));
+    const eddsaH = mod(BigIntFromByteArray(await SHA512_Digest(ConcatUint8Arrays([gRMul.toRawBytes(), pub.toRawBytes(), message]))));
+    const blurHCMKMul = mod(eddsaH * multiplier * blur);
+    return { blurHCMKMul, blur, gRMul };
+}
+export async function unblindSignature(blindS, blur) {
+    const s = mod(blindS * mod_inv(blur));
+    return s;
+}
+export async function verifyBlindSignature(S, noncePublic, pub, message) {
+    const valid = await EdDSA.verifyRaw(S, noncePublic, pub, message);
+    if (!valid) {
+        console.error(`Signature failed. \nM: ${bytesToBase64(message)}\nS: ${S.toString()}\nNoncePublic: ${noncePublic.toBase64()}\nPublic: ${pub.toBase64()}`);
+    }
+    return valid;
+}
+export function serializeBlindSig(S, noncePublic) {
+    return ConcatUint8Arrays([BigIntToByteArray(S), noncePublic.toRawBytes()]);
+}

package/dist/Cryptide/Signing/EdDSA.d.ts

@@ -0,0 +1,14 @@
+import { Point } from "../Ed25519";
+/**
+ * Sign the msg with a private key in non-standard way as it uses a random number generator. Non-deterministic.
+ */
+export declare function sign(msg: string | Uint8Array, priv: bigint): Promise<string>;
+/**
+ * Verify a EdDSA signature, given a signature, public key and message.
+ */
+export declare function verify(sig: string, pub: string | Point, msg: string | Uint8Array): Promise<boolean>;
+/**
+ * Verify a message with raw S and R
+ */
+export declare function verifyRaw(S: bigint, R: Point, A: Point, M: Uint8Array): Promise<boolean>;
+//# sourceMappingURL=EdDSA.d.ts.map

package/dist/Cryptide/Signing/EdDSA.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EdDSA.d.ts","sourceRoot":"","sources":["../../../Cryptide/Signing/EdDSA.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAE,KAAK,EAAS,MAAM,YAAY,CAAC;AAM1C;;GAEG;AACH,wBAAsB,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,EAAE,IAAI,EAAE,MAAM,mBAehE;AAED;;GAEG;AACH,wBAAsB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,oBAiBtF;AAED;;GAEG;AACH,wBAAsB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,oBAQ3E"}