iscc-core-ts 0.0.7 → 0.0.9

package/README.md

@@ -1,5 +1,71 @@
 # iscc-core-ts
-Iscc core TypeScript implementation of iscc-core reference
+Iscc core TypeScript implementation of [iscc-core python reference](https://github.com/iscc/iscc-core)
+
+# Project summary
+
+The “ISCC-CORE typescript implementation library” goal is to implement core functions of the new [ISCC standard ISO 24138:2024](https://www.iso.org/fr/standard/77899.html) in Typescript programming language.
+This typescript core library will be useful for the javascript ecosystem and developers ( frontend, backend ) to use and work with this new standard in their project.
+
+The ISCC stands for “International Standard Content Code”. More detail at [https://iscc.codes/](https://iscc.codes/)
+
+The ISCC is a similarity preserving fingerprint and identifier for digital media assets.
+
+ISCCs are generated algorithmically from digital content, just like cryptographic hashes. However, instead of using a single cryptographic hash function to identify data only, the ISCC uses various algorithms to create a composite identifier that exhibits similarity-preserving properties (soft hash).
+
+The component-based structure of the ISCC identifies content at multiple levels of abstraction. Each component is self-describing, modular, and can be used separately or with others to aid in various content identification tasks. The algorithmic design supports content deduplication, database synchronization, indexing, integrity verification, timestamping, versioning, data provenance, similarity clustering, anomaly detection, usage tracking, allocation of royalties, fact-checking and general digital asset management use-cases.
+
+# Work In progress
+
+This library is under development. It is not ready for production. The current development planning can be check [here](https://github.com/users/branciard/projects/1)
+
+| Functions  | Implementation  | test coverage
+| ---------- | --------------  | -------- |
+| gen_meta_code_v0   | Done    | ☑ test_0001_title_only
+|                    |         | ☑ test_0002_title_extra
+|                    |         | ☑ test_0003_96_bits
+|                    |         | ☑ test_0004_128_bits
+|                    |         | ☑ test_0005_160_bits
+|                    |         | ☑ test_0006_192_bits
+|                    |         | ☑ test_0007_224_bits
+|                    |         | ☑ test_0008_256_bits
+|                    |         | ☑ test_0009_i18n
+|                    |         | ☑ test_0010_normalizeation
+|                    |         | ☑ test_0011_trim
+|                    |         | ☑ test_0012_trim_i18n
+|                    |         | ☐ test_0013_norm_i18n_256
+|                    |         | ☑ test_0014_meta_object_json
+|                    |         | ☑ test_0015_meta_object_json_ld
+|                    |         | ☑ test_0016_meta_data_url
+| gen_text_code_v0   |  Done   | ☑ test_0000_empty_str
+|                    |         | ☑ test_0001_hello_world
+|                    |         | ☑ test_0002_hello_world_256_bits
+|                    |         | ☑ test_0003_i18n
+|                    |         | ☑ test_0004_more    
+| gen_image_code_v0  |  Done   | ☑ test_0000_all_black_64 
+|                    |         | ☑ test_0001_all_white_128 
+|                    |         | ☑ test_0003_img_256 
+| gen_audio_code_v0  |  Done   | ☑ test_0000_empty_64
+|                    |         | ☑ test_0001_one_128 
+|                    |         | ☑ test_0002_two_256
+|                    |         | ☑ test_0003_test_neg_256
+|                    |         | ☑ test_0004_cv_256
+| gen_video_code_v0  |  Done   | ☑ test_0000_one_zero_frame_64
+|                    |         | ☑ test_0001_multiple_frames_128
+|                    |         | ☑ test_0003_range_256
+| gen_mixed_code_v0  |  TODO   | ☐ test_0000_std_64
+|                    |         | ☐ test_0001_128_truncated 
+| gen_data_code_v0   |  TODO   | ☐ test_0000_two_bytes_64
+|                    |         | ☐ test_0001_empty_64
+|                    |         | ☐ test_0002_zero_128
+|                    |         | ☐ test_0003_static_256
+| gen_instance_code_v0   |  TODO   | ☐ test_0000_empty_64
+|                    |         | ☐ test_0001_zero_128
+|                    |         | ☐ test_0002_static_256
+| gen_iscc_code_v0   |  TODO   | ☐ test_0000_standard
+|                    |         | ☐ test_0001_no_meta
+|                    |         | ☐ test_0002_no_meta_content_256
+|                    |         | ☐ test_0003_no_meta_content_128
+|                    |         | ☐ test_0004_ordering
 
 
 
@@ -10,14 +76,15 @@ We recomand to use [nvm](https://github.com/nvm-sh/nvm) to install and target no
 Nvm version used:
 ```sh
 nvm --version
-0.39.3
+0.40.1
 ```
 Install node 21 
 
 ```sh
-nvm install 21
-v21.7.1 is already installed.
-Now using node v21.7.1 (npm v10.5.0)
+nvm install --lts
+Installing latest LTS version.
+v20.18.0 is already installed.
+Now using node v22.11.0 (npm v10.9.0)
 ```
 
 # Install and build

package/lib/cjs/code-content-audio.d.ts

@@ -0,0 +1,22 @@
+/**
+ *
+*The Content-Code Audio is generated from a Chromaprint fingerprint provided as a vector of 32-bit
+signed integers. The [iscc-sdk](https://github.com/iscc/iscc-sdk) uses
+[fpcalc](https://acoustid.org/chromaprint) to extract Chromaprint vectors with the following
+command line parameters:
+
+`$ fpcalc -raw -json -signed -length 0 myaudiofile.mp3`
+ */
+export declare function gen_audio_code(chromaprint: number[], bits?: number, version?: number): {
+    iscc: string;
+};
+/**
+*
+* @param name
+* @param description
+* @returns
+*/
+export declare function gen_audio_code_v0(chromaprint: number[], bits?: number): {
+    iscc: string;
+};
+export declare function soft_hash_audio_v0(cv: Iterable<number>, bits?: number): Uint8Array;

package/lib/cjs/code-content-audio.js

@@ -0,0 +1,145 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.gen_audio_code = gen_audio_code;
+exports.gen_audio_code_v0 = gen_audio_code_v0;
+exports.soft_hash_audio_v0 = soft_hash_audio_v0;
+const codec_1 = require("./codec");
+const constants_1 = require("./constants");
+/**
+ *
+*The Content-Code Audio is generated from a Chromaprint fingerprint provided as a vector of 32-bit
+signed integers. The [iscc-sdk](https://github.com/iscc/iscc-sdk) uses
+[fpcalc](https://acoustid.org/chromaprint) to extract Chromaprint vectors with the following
+command line parameters:
+
+`$ fpcalc -raw -json -signed -length 0 myaudiofile.mp3`
+ */
+function gen_audio_code(chromaprint, bits, version) {
+    if (!version) {
+        version = 0;
+    }
+    if (version == 0) {
+        return gen_audio_code_v0(chromaprint, bits);
+    }
+    else {
+        throw new Error('Only ISCC version 0 is supported');
+    }
+}
+/**
+*
+* @param name
+* @param description
+* @returns
+*/
+function gen_audio_code_v0(chromaprint, bits) {
+    const digest = Buffer.from(soft_hash_audio_v0(chromaprint, bits ? bits : 64)).toString('hex');
+    const audio_code = (0, codec_1.encode_component)(constants_1.MainTypes.CONTENT, constants_1.SubTypes.AUDIO, constants_1.Version.V0, bits ? bits : 64, 
+    // fix bug https://github.com/nodejs/node/issues/21242 https://github.com/merkletreejs/merkletreejs/pull/91
+    digest.length % 2 ? '0' + digest : digest);
+    const iscc = 'ISCC:' + audio_code;
+    return {
+        iscc: iscc
+    };
+}
+function soft_hash_audio_v0(cv, bits = 64) {
+    /**
+     * Create audio similarity hash from a chromaprint vector.
+     *
+     * @param cv - Chromaprint vector
+     * @param bits - Bit-length resulting similarity hash (multiple of 32)
+     * @return Audio-Hash digest
+     */
+    // Convert chromaprint vector into list of 4 byte digests
+    const digests = Array.from(cv).map(intFeature => new Uint8Array(new Int32Array([intFeature]).buffer).reverse());
+    // Return identity hash if we have 0 digests
+    if (digests.length === 0) {
+        return new Uint8Array(32);
+    }
+    // Calculate simhash of digests as first 32-bit chunk of the hash
+    const parts = [algSimhash(digests)];
+    let bitLength = 32;
+    // Calculate separate 32-bit simhashes for each quarter of features (original order)
+    for (const bucket of divide(4, digests)) {
+        const features = Array.from(bucket);
+        if (features.length > 0) {
+            parts.push(algSimhash(features));
+        }
+        else {
+            parts.push(new Uint8Array(4));
+        }
+        bitLength += 32;
+        if (bitLength === bits) {
+            return concatenateUint8Arrays(parts);
+        }
+    }
+    // Calculate separate simhashes for each third of features (ordered by int value)
+    const cvs = Array.from(cv).sort((a, b) => a - b);
+    const sortedDigests = cvs.map(intFeature => new Uint8Array(new Int32Array([intFeature]).buffer).reverse());
+    for (const bucket of divide(3, sortedDigests)) {
+        const features = Array.from(bucket);
+        if (features.length > 0) {
+            parts.push(algSimhash(features));
+        }
+        else {
+            parts.push(new Uint8Array(4));
+        }
+        bitLength += 32;
+        if (bitLength === bits) {
+            return concatenateUint8Arrays(parts);
+        }
+    }
+    return concatenateUint8Arrays(parts);
+}
+function algSimhash(hashDigests) {
+    /**
+     * Creates a similarity preserving hash from a sequence of equal sized hash digests.
+     *
+     * @param hashDigests - A sequence of equally sized byte-hashes.
+     * @returns Similarity byte-hash
+     */
+    const nBytes = hashDigests[0].length;
+    const nBits = nBytes * 8;
+    const vector = new Array(nBits).fill(0);
+    for (const digest of hashDigests) {
+        for (let i = 0; i < nBits; i++) {
+            const byteIndex = Math.floor(i / 8);
+            const bitIndex = i % 8;
+            vector[i] += (digest[byteIndex] & (1 << (7 - bitIndex))) !== 0 ? 1 : 0;
+        }
+    }
+    const minFeatures = hashDigests.length / 2;
+    let shash = BigInt(0);
+    for (let i = 0; i < nBits; i++) {
+        if (vector[i] >= minFeatures) {
+            shash |= BigInt(1) << BigInt(nBits - 1 - i);
+        }
+    }
+    return bigIntToUint8Array(shash, nBytes);
+}
+function* divide(n, iterable) {
+    const arr = Array.from(iterable);
+    const chunkSize = Math.ceil(arr.length / n);
+    for (let i = 0; i < n; i++) {
+        yield arr.slice(i * chunkSize, (i + 1) * chunkSize);
+    }
+}
+function concatenateUint8Arrays(arrays) {
+    const totalLength = arrays.reduce((sum, arr) => sum + arr.length, 0);
+    const result = new Uint8Array(totalLength);
+    let offset = 0;
+    for (const arr of arrays) {
+        result.set(arr, offset);
+        offset += arr.length;
+    }
+    return result;
+}
+function bigIntToUint8Array(bigInt, byteLength) {
+    const result = new Uint8Array(byteLength);
+    let tempBigInt = BigInt(bigInt); // Create a copy to avoid modifying the original
+    for (let i = 0; i < byteLength; i++) {
+        result[byteLength - 1 - i] = Number(tempBigInt & 255n);
+        tempBigInt = tempBigInt >> 8n;
+    }
+    return result;
+}
+//# sourceMappingURL=code-content-audio.js.map

package/lib/cjs/code-content-audio.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-content-audio.js","sourceRoot":"","sources":["../../src/code-content-audio.ts"],"names":[],"mappings":";;AAmBA,wCAeC;AASD,8CAsBC;AAGD,gDAyDC;AA5HD,mCAA2C;AAC3C,2CAIqB;AAErB;;;;;;;;GAQG;AAGH,SAAgB,cAAc,CAC1B,WAAqB,EACrB,IAAa,EACb,OAAgB;IAIhB,IAAI,CAAC,OAAO,EAAE,CAAC;QACX,OAAO,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACf,OAAO,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;SAAM,CAAC;QACJ,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACxD,CAAC;AACL,CAAC;AAED;;;;;EAKE;AAEF,SAAgB,iBAAiB,CAC7B,WAAqB,EACrB,IAAa;IAMb,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7F,MAAM,UAAU,GAAG,IAAA,wBAAgB,EAC/B,qBAAS,CAAC,OAAO,EACjB,oBAAQ,CAAC,KAAK,EACd,mBAAO,CAAC,EAAE,EACV,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;IAChB,2GAA2G;IAC3G,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAC5C,CAAC;IAEF,MAAM,IAAI,GAAG,OAAO,GAAG,UAAU,CAAC;IAClC,OAAO;QACH,IAAI,EAAE,IAAI;KACb,CAAC;AACN,CAAC;AAGD,SAAgB,kBAAkB,CAAC,EAAoB,EAAE,OAAe,EAAE;IACtE;;;;;;OAMG;IAEH,yDAAyD;IACzD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAC5C,IAAI,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAChE,CAAC;IAEF,4CAA4C;IAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,iEAAiE;IACjE,MAAM,KAAK,GAAiB,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;IAElD,IAAI,SAAS,GAAG,EAAE,CAAC;IAEnB,oFAAoF;IACpF,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;QACrC,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,SAAS,IAAI,EAAE,CAAC;QAChB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACrB,OAAO,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACzC,CAAC;IACL,CAAC;IAED,iFAAiF;IACjF,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,aAAa,GAAG,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CACvC,IAAI,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAChE,CAAC;IACF,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;QACrC,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,SAAS,IAAI,EAAE,CAAC;QAChB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACrB,OAAO,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACzC,CAAC;IACL,CAAC;IAED,OAAO,sBAAsB,CAAC,KAAK,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,UAAU,CAAC,WAAyB;IACzC;;;;;OAKG;IAEH,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACrC,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,CAAC;IACL,CAAC;IAED,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3C,IAAI,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC;YAC3B,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;IACL,CAAC;IAED,OAAO,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAC7C,CAAC;AAED,QAAQ,CAAC,CAAC,MAAM,CAAI,CAAS,EAAE,QAAqB;IAChD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;IACxD,CAAC;AACL,CAAC;AAED,SAAS,sBAAsB,CAAC,MAAoB;IAChD,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC;IACzB,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAc,EAAE,UAAkB;IAC1D,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;IAC1C,IAAI,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,gDAAgD;IACjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;QACvD,UAAU,GAAG,UAAU,IAAI,EAAE,CAAC;IAClC,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC","sourcesContent":["\nimport { encode_component } from './codec';\nimport {\n    MainTypes,\n    SubTypes,\n    Version\n} from './constants';\n\n/**\n * \n*The Content-Code Audio is generated from a Chromaprint fingerprint provided as a vector of 32-bit\nsigned integers. The [iscc-sdk](https://github.com/iscc/iscc-sdk) uses\n[fpcalc](https://acoustid.org/chromaprint) to extract Chromaprint vectors with the following\ncommand line parameters:\n\n`$ fpcalc -raw -json -signed -length 0 myaudiofile.mp3`\n */\n\n\nexport function gen_audio_code(\n    chromaprint: number[],\n    bits?: number,\n    version?: number\n): {\n    iscc: string\n}{\n    if (!version) {\n        version = 0;\n    }\n    if (version == 0) {\n        return gen_audio_code_v0(chromaprint, bits);\n    } else {\n        throw new Error('Only ISCC version 0 is supported');\n    }\n}\n\n/**\n*\n* @param name\n* @param description\n* @returns\n*/\n\nexport function gen_audio_code_v0(\n    chromaprint: number[],\n    bits?: number\n): {\n    iscc: string\n} {\n\n\n    const digest = Buffer.from(soft_hash_audio_v0(chromaprint,bits ? bits : 64)).toString('hex');\n    const audio_code = encode_component(\n        MainTypes.CONTENT,\n        SubTypes.AUDIO,\n        Version.V0,\n        bits ? bits : 64,\n        // fix bug https://github.com/nodejs/node/issues/21242 https://github.com/merkletreejs/merkletreejs/pull/91\n        digest.length % 2 ? '0' + digest : digest\n    );\n\n    const iscc = 'ISCC:' + audio_code;\n    return {\n        iscc: iscc\n    };\n}\n\n\nexport function soft_hash_audio_v0(cv: Iterable<number>, bits: number = 64): Uint8Array {\n    /**\n     * Create audio similarity hash from a chromaprint vector.\n     *\n     * @param cv - Chromaprint vector\n     * @param bits - Bit-length resulting similarity hash (multiple of 32)\n     * @return Audio-Hash digest\n     */\n\n    // Convert chromaprint vector into list of 4 byte digests\n    const digests = Array.from(cv).map(intFeature => \n        new Uint8Array(new Int32Array([intFeature]).buffer).reverse()\n    );\n\n    // Return identity hash if we have 0 digests\n    if (digests.length === 0) {\n        return new Uint8Array(32);\n    }\n\n    // Calculate simhash of digests as first 32-bit chunk of the hash\n    const parts: Uint8Array[] = [algSimhash(digests)];\n\n    let bitLength = 32;\n\n    // Calculate separate 32-bit simhashes for each quarter of features (original order)\n    for (const bucket of divide(4, digests)) {\n        const features = Array.from(bucket);\n        if (features.length > 0) {\n            parts.push(algSimhash(features));\n        } else {\n            parts.push(new Uint8Array(4));\n        }\n        bitLength += 32;\n        if (bitLength === bits) {\n            return concatenateUint8Arrays(parts);\n        }\n    }\n\n    // Calculate separate simhashes for each third of features (ordered by int value)\n    const cvs = Array.from(cv).sort((a, b) => a - b);\n    const sortedDigests = cvs.map(intFeature => \n        new Uint8Array(new Int32Array([intFeature]).buffer).reverse()\n    );\n    for (const bucket of divide(3, sortedDigests)) {\n        const features = Array.from(bucket);\n        if (features.length > 0) {\n            parts.push(algSimhash(features));\n        } else {\n            parts.push(new Uint8Array(4));\n        }\n        bitLength += 32;\n        if (bitLength === bits) {\n            return concatenateUint8Arrays(parts);\n        }\n    }\n\n    return concatenateUint8Arrays(parts);\n}\n\nfunction algSimhash(hashDigests: Uint8Array[]): Uint8Array {\n    /**\n     * Creates a similarity preserving hash from a sequence of equal sized hash digests.\n     *\n     * @param hashDigests - A sequence of equally sized byte-hashes.\n     * @returns Similarity byte-hash\n     */\n\n    const nBytes = hashDigests[0].length;\n    const nBits = nBytes * 8;\n    const vector = new Array(nBits).fill(0);\n    for (const digest of hashDigests) {\n        for (let i = 0; i < nBits; i++) {\n            const byteIndex = Math.floor(i / 8);\n            const bitIndex = i % 8;\n            vector[i] += (digest[byteIndex] & (1 << (7 - bitIndex))) !== 0 ? 1 : 0;\n        }\n    }\n\n    const minFeatures = hashDigests.length / 2;\n    let shash = BigInt(0);\n\n    for (let i = 0; i < nBits; i++) {\n        if (vector[i] >= minFeatures) {\n            shash |= BigInt(1) << BigInt(nBits - 1 - i);\n        }\n    }\n\n    return bigIntToUint8Array(shash, nBytes);\n}\n\nfunction* divide<T>(n: number, iterable: Iterable<T>): Generator<T[]> {\n    const arr = Array.from(iterable);\n    const chunkSize = Math.ceil(arr.length / n);\n    for (let i = 0; i < n; i++) {\n        yield arr.slice(i * chunkSize, (i + 1) * chunkSize);\n    }\n}\n\nfunction concatenateUint8Arrays(arrays: Uint8Array[]): Uint8Array {\n    const totalLength = arrays.reduce((sum, arr) => sum + arr.length, 0);\n    const result = new Uint8Array(totalLength);\n    let offset = 0;\n    for (const arr of arrays) {\n        result.set(arr, offset);\n        offset += arr.length;\n    }\n    return result;\n}\n\nfunction bigIntToUint8Array(bigInt: bigint, byteLength: number): Uint8Array {\n    const result = new Uint8Array(byteLength);\n    let tempBigInt = BigInt(bigInt); // Create a copy to avoid modifying the original\n    for (let i = 0; i < byteLength; i++) {\n        result[byteLength - 1 - i] = Number(tempBigInt & 255n);\n        tempBigInt = tempBigInt >> 8n;\n    }\n    return result;\n}"]}

package/lib/cjs/code-content-image.d.ts

@@ -0,0 +1,21 @@
+export declare function gen_image_code(pixels: number[], bits?: number, version?: number): {
+    iscc: string;
+};
+/**
+*
+* @param name
+* @param description
+* @returns
+*/
+export declare function gen_image_code_v0(pixels: number[], bits?: number): {
+    iscc: string;
+};
+/**
+ * Calculate image hash from normalized grayscale pixel sequence of length 1024.
+ *
+ * @param pixels - Normalized image pixels
+ * @param bits - Bit-length of image hash (default 64).
+ * @return Similarity preserving Image-Hash digest.
+ */
+export declare function soft_hash_image_v0(pixels: number[], bits: number): Uint8Array;
+export declare function algDct(v: number[]): number[];

package/lib/cjs/code-content-image.js

@@ -0,0 +1,121 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.gen_image_code = gen_image_code;
+exports.gen_image_code_v0 = gen_image_code_v0;
+exports.soft_hash_image_v0 = soft_hash_image_v0;
+exports.algDct = algDct;
+const codec_1 = require("./codec");
+const constants_1 = require("./constants");
+function gen_image_code(pixels, bits, version) {
+    if (!version) {
+        version = 0;
+    }
+    if (version == 0) {
+        return gen_image_code_v0(pixels, bits);
+    }
+    else {
+        throw new Error('Only ISCC version 0 is supported');
+    }
+}
+/**
+*
+* @param name
+* @param description
+* @returns
+*/
+function gen_image_code_v0(pixels, bits) {
+    const digest = Buffer.from(soft_hash_image_v0(pixels, bits ? bits : constants_1.IMAGE_BITS)).toString('hex');
+    const image_code = (0, codec_1.encode_component)(constants_1.MainTypes.CONTENT, constants_1.SubTypes.IMAGE, constants_1.Version.V0, bits ? bits : constants_1.IMAGE_BITS, 
+    // fix bug https://github.com/nodejs/node/issues/21242 https://github.com/merkletreejs/merkletreejs/pull/91
+    digest.length % 2 ? '0' + digest : digest);
+    const iscc = 'ISCC:' + image_code;
+    return {
+        iscc: iscc
+    };
+}
+/**
+ * Calculate image hash from normalized grayscale pixel sequence of length 1024.
+ *
+ * @param pixels - Normalized image pixels
+ * @param bits - Bit-length of image hash (default 64).
+ * @return Similarity preserving Image-Hash digest.
+ */
+function soft_hash_image_v0(pixels, bits) {
+    if (bits > 256) {
+        throw new Error(`${bits} bits exceeds max length 256 for soft_hash_image`);
+    }
+    // DCT per row
+    const dctRowLists = [];
+    for (let i = 0; i < pixels.length; i += 32) {
+        dctRowLists.push(algDct(pixels.slice(i, i + 32)));
+    }
+    // DCT per col
+    const dctRowListsT = dctRowLists[0].map((_, colIndex) => dctRowLists.map(row => row[colIndex]));
+    const dctColListsT = dctRowListsT.map(algDct);
+    const dctMatrix = dctColListsT[0].map((_, rowIndex) => dctColListsT.map(col => col[rowIndex]));
+    function flatten(m, x, y) {
+        return m.slice(y, y + 8).flatMap(row => row.slice(x, x + 8));
+    }
+    let bitstring = "";
+    const slices = [[0, 0], [1, 0], [0, 1], [1, 1]];
+    for (const [x, y] of slices) {
+        // Extract 8 x 8 slice
+        const flatList = flatten(dctMatrix, x, y);
+        // Calculate median
+        const med = median(flatList);
+        // Append 64-bit digest by comparing to median
+        for (const value of flatList) {
+            bitstring += value > med ? "1" : "0";
+        }
+        const bl = bitstring.length;
+        if (bl >= bits) {
+            const hashDigest = new Uint8Array(Math.floor(bl / 8));
+            for (let i = 0; i < bl; i += 8) {
+                hashDigest[i / 8] = parseInt(bitstring.substr(i, 8), 2);
+            }
+            return hashDigest;
+        }
+    }
+    throw new Error("Failed to generate hash digest");
+}
+function median(numbers) {
+    const sorted = numbers.slice().sort((a, b) => a - b);
+    const middle = Math.floor(sorted.length / 2);
+    if (sorted.length % 2 === 0) {
+        return (sorted[middle - 1] + sorted[middle]) / 2;
+    }
+    return sorted[middle];
+}
+function algDct(v) {
+    /**
+     * Discrete cosine transform.
+     *
+     * See: [nayuki.io](https://www.nayuki.io/page/fast-discrete-cosine-transform-algorithms).
+     *
+     * @param v - Input vector for DCT calculation.
+     * @return DCT Transformed vector.
+     */
+    const n = v.length;
+    if (n === 1) {
+        return [...v];
+    }
+    else if (n === 0 || n % 2 !== 0) {
+        throw new Error("Invalid input length");
+    }
+    else {
+        const half = Math.floor(n / 2);
+        const alpha = Array.from({ length: half }, (_, i) => v[i] + v[n - 1 - i]);
+        const beta = Array.from({ length: half }, (_, i) => (v[i] - v[n - 1 - i]) / (Math.cos((i + 0.5) * Math.PI / n) * 2.0));
+        const alphaTransformed = algDct(alpha);
+        const betaTransformed = algDct(beta);
+        const result = [];
+        for (let i = 0; i < half - 1; i++) {
+            result.push(alphaTransformed[i]);
+            result.push(betaTransformed[i] + betaTransformed[i + 1]);
+        }
+        result.push(alphaTransformed[half - 1]);
+        result.push(betaTransformed[half - 1]);
+        return result;
+    }
+}
+//# sourceMappingURL=code-content-image.js.map

package/lib/cjs/code-content-image.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-content-image.js","sourceRoot":"","sources":["../../src/code-content-image.ts"],"names":[],"mappings":";;AASA,wCAeC;AASD,8CAsBC;AAUD,gDAkDC;AAiBD,wBAmCC;AAvKD,mCAA2C;AAC3C,2CAKqB;AAGrB,SAAgB,cAAc,CAC1B,MAAgB,EAChB,IAAa,EACb,OAAgB;IAIhB,IAAI,CAAC,OAAO,EAAE,CAAC;QACX,OAAO,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACf,OAAO,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC3C,CAAC;SAAM,CAAC;QACJ,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACxD,CAAC;AACL,CAAC;AAED;;;;;EAKE;AAEF,SAAgB,iBAAiB,CAC7B,MAAgB,EACjB,IAAa;IAMZ,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,sBAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChG,MAAM,UAAU,GAAG,IAAA,wBAAgB,EAC/B,qBAAS,CAAC,OAAO,EACjB,oBAAQ,CAAC,KAAK,EACd,mBAAO,CAAC,EAAE,EACV,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,sBAAU;IACxB,2GAA2G;IAC3G,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAC5C,CAAC;IAEF,MAAM,IAAI,GAAG,OAAO,GAAG,UAAU,CAAC;IAClC,OAAO;QACH,IAAI,EAAE,IAAI;KACb,CAAC;AACN,CAAC;AAGG;;;;;;GAMG;AACP,SAAgB,kBAAkB,CAC9B,MAAgB,EAChB,IAAY;IAEZ,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,kDAAkD,CAAC,CAAC;IAC/E,CAAC;IAEF,cAAc;IACd,MAAM,WAAW,GAAe,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QACzC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,cAAc;IACd,MAAM,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAChG,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAE9C,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAE/F,SAAS,OAAO,CAAC,CAAa,EAAE,CAAS,EAAE,CAAS;QAChD,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,IAAI,SAAS,GAAG,EAAE,CAAC;IACnB,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;QAC1B,sBAAsB;QACtB,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1C,mBAAmB;QACnB,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QAE7B,8CAA8C;QAC9C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC3B,SAAS,IAAI,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACzC,CAAC;QAED,MAAM,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC;QAC5B,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;YACb,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5D,CAAC;YACD,OAAO,UAAU,CAAC;QACtB,CAAC;IACL,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;AACrD,CAAC;AAID,SAAS,MAAM,CAAC,OAAiB;IAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE7C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC;AAC1B,CAAC;AAID,SAAgB,MAAM,CAAC,CAAW;IAC9B;;;;;;;OAOG;IAEH,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IAClB,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;IAC5C,CAAC;SAAM,CAAC;QACJ,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC/C,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CACpE,CAAC;QAEF,MAAM,gBAAgB,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,eAAe,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAErC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QAEvC,OAAO,MAAM,CAAC;IAClB,CAAC;AACL,CAAC","sourcesContent":["import { encode_component } from './codec';\nimport {\n    MainTypes,\n    SubTypes,\n    IMAGE_BITS,\n    Version\n} from './constants';\n\n\nexport function gen_image_code(\n    pixels: number[],\n    bits?: number,\n    version?: number\n): {\n    iscc: string\n}{\n    if (!version) {\n        version = 0;\n    }\n    if (version == 0) {\n        return gen_image_code_v0(pixels, bits);\n    } else {\n        throw new Error('Only ISCC version 0 is supported');\n    }\n}\n\n/**\n*\n* @param name\n* @param description\n* @returns\n*/\n\nexport function gen_image_code_v0(\n    pixels: number[],\n   bits?: number\n): {\n    iscc: string\n} {\n\n\n    const digest = Buffer.from(soft_hash_image_v0(pixels,bits ? bits : IMAGE_BITS)).toString('hex');\n    const image_code = encode_component(\n        MainTypes.CONTENT,\n        SubTypes.IMAGE,\n        Version.V0,\n        bits ? bits : IMAGE_BITS,\n        // fix bug https://github.com/nodejs/node/issues/21242 https://github.com/merkletreejs/merkletreejs/pull/91\n        digest.length % 2 ? '0' + digest : digest\n    );\n\n    const iscc = 'ISCC:' + image_code;\n    return {\n        iscc: iscc\n    };\n}\n\n\n    /**\n     * Calculate image hash from normalized grayscale pixel sequence of length 1024.\n     *\n     * @param pixels - Normalized image pixels\n     * @param bits - Bit-length of image hash (default 64).\n     * @return Similarity preserving Image-Hash digest.\n     */\nexport function soft_hash_image_v0(\n    pixels: number[],\n    bits: number\n): Uint8Array {\n    if (bits > 256) {\n        throw new Error(`${bits} bits exceeds max length 256 for soft_hash_image`);\n    }\n   \n   // DCT per row\n   const dctRowLists: number[][] = [];\n   for (let i = 0; i < pixels.length; i += 32) {\n       dctRowLists.push(algDct(pixels.slice(i, i + 32)));\n   }\n\n   // DCT per col\n   const dctRowListsT = dctRowLists[0].map((_, colIndex) => dctRowLists.map(row => row[colIndex]));\n   const dctColListsT = dctRowListsT.map(algDct);\n\n   const dctMatrix = dctColListsT[0].map((_, rowIndex) => dctColListsT.map(col => col[rowIndex]));\n\n   function flatten(m: number[][], x: number, y: number): number[] {\n       return m.slice(y, y + 8).flatMap(row => row.slice(x, x + 8));\n   }\n\n   let bitstring = \"\";\n   const slices = [[0, 0], [1, 0], [0, 1], [1, 1]];\n\n   for (const [x, y] of slices) {\n       // Extract 8 x 8 slice\n       const flatList = flatten(dctMatrix, x, y);\n\n       // Calculate median\n       const med = median(flatList);\n\n       // Append 64-bit digest by comparing to median\n       for (const value of flatList) {\n           bitstring += value > med ? \"1\" : \"0\";\n       }\n       \n       const bl = bitstring.length;\n       if (bl >= bits) {\n           const hashDigest = new Uint8Array(Math.floor(bl / 8));\n           for (let i = 0; i < bl; i += 8) {\n               hashDigest[i / 8] = parseInt(bitstring.substr(i, 8), 2);\n           }\n           return hashDigest;\n       }\n   }\n\n   throw new Error(\"Failed to generate hash digest\");\n}\n\n\n\nfunction median(numbers: number[]): number {\n    const sorted = numbers.slice().sort((a, b) => a - b);\n    const middle = Math.floor(sorted.length / 2);\n\n    if (sorted.length % 2 === 0) {\n        return (sorted[middle - 1] + sorted[middle]) / 2;\n    }\n\n    return sorted[middle];\n}\n\n\n\nexport function algDct(v: number[]): number[] {\n    /**\n     * Discrete cosine transform.\n     *\n     * See: [nayuki.io](https://www.nayuki.io/page/fast-discrete-cosine-transform-algorithms).\n     *\n     * @param v - Input vector for DCT calculation.\n     * @return DCT Transformed vector.\n     */\n\n    const n = v.length;\n    if (n === 1) {\n        return [...v];\n    } else if (n === 0 || n % 2 !== 0) {\n        throw new Error(\"Invalid input length\");\n    } else {\n        const half = Math.floor(n / 2);\n        const alpha = Array.from({ length: half }, (_, i) => v[i] + v[n - 1 - i]);\n        const beta = Array.from({ length: half }, (_, i) => \n            (v[i] - v[n - 1 - i]) / (Math.cos((i + 0.5) * Math.PI / n) * 2.0)\n        );\n        \n        const alphaTransformed = algDct(alpha);\n        const betaTransformed = algDct(beta);\n        \n        const result: number[] = [];\n        for (let i = 0; i < half - 1; i++) {\n            result.push(alphaTransformed[i]);\n            result.push(betaTransformed[i] + betaTransformed[i + 1]);\n        }\n        result.push(alphaTransformed[half - 1]);\n        result.push(betaTransformed[half - 1]);\n        \n        return result;\n    }\n}"]}

package/lib/cjs/code-content-text.d.ts

@@ -0,0 +1,38 @@
+export declare function gen_text_code(text: string, bits?: number, version?: number): {
+    iscc: string;
+    characters: number;
+};
+/**
+*
+* @param name
+* @param description
+* @returns
+*/
+export declare function gen_text_code_v0(text: string, bits?: number): {
+    iscc: string;
+    characters: number;
+};
+/**
+ *
+ *
+ *     Creates a 256-bit similarity preserving hash for text input with algorithm v0.
+
+    - Slide over text with a
+      [`text_ngram_size`][iscc_core.options.CoreOptions.text_ngram_size] wide window
+      and create [`xxh32`](https://cyan4973.github.io/xxHash/) hashes
+    - Create a [`minhash_256`][iscc_core.minhash.alg_minhash_256] from the hashes generated
+      in the previous step.
+
+    !!! note
+
+        Before passing text to this function it must be:
+
+        - stripped of markup
+        - normalized
+        - stripped of whitespace
+        - lowercased
+
+ * @param text
+ * @returns
+ */
+export declare function soft_hash_text_v0(text: string): Uint8Array;

package/lib/cjs/code-content-text.js

@@ -0,0 +1,72 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.gen_text_code = gen_text_code;
+exports.gen_text_code_v0 = gen_text_code_v0;
+exports.soft_hash_text_v0 = soft_hash_text_v0;
+const constants_1 = require("./constants");
+const content_normalization_1 = require("./content-normalization");
+const utils_1 = require("./utils");
+const minhash_1 = require("./minhash");
+const js_xxhash_1 = require("js-xxhash");
+const codec_1 = require("./codec");
+const constants_2 = require("./constants");
+function gen_text_code(text, bits, version) {
+    if (!version) {
+        version = 0;
+    }
+    if (version == 0) {
+        return gen_text_code_v0(text, bits);
+    }
+    else {
+        throw new Error('Only ISCC version 0 is supported');
+    }
+}
+/**
+*
+* @param name
+* @param description
+* @returns
+*/
+function gen_text_code_v0(text, bits) {
+    text = (0, content_normalization_1.text_collapse)(text);
+    const characters = text ? text.length : 0;
+    const digest = Buffer.from(soft_hash_text_v0(text)).toString('hex');
+    const text_code = (0, codec_1.encode_component)(constants_2.MainTypes.CONTENT, constants_2.SubTypes.TEXT, constants_2.Version.V0, bits ? bits : constants_2.TEXT_BITS, 
+    // fix bug https://github.com/nodejs/node/issues/21242 https://github.com/merkletreejs/merkletreejs/pull/91
+    digest.length % 2 ? '0' + digest : digest);
+    const iscc = 'ISCC:' + text_code;
+    return {
+        iscc: iscc,
+        characters: characters
+    };
+}
+/**
+ *
+ *
+ *     Creates a 256-bit similarity preserving hash for text input with algorithm v0.
+
+    - Slide over text with a
+      [`text_ngram_size`][iscc_core.options.CoreOptions.text_ngram_size] wide window
+      and create [`xxh32`](https://cyan4973.github.io/xxHash/) hashes
+    - Create a [`minhash_256`][iscc_core.minhash.alg_minhash_256] from the hashes generated
+      in the previous step.
+
+    !!! note
+
+        Before passing text to this function it must be:
+
+        - stripped of markup
+        - normalized
+        - stripped of whitespace
+        - lowercased
+
+ * @param text
+ * @returns
+ */
+function soft_hash_text_v0(text) {
+    const ngrams = (0, utils_1.sliding_window)(text, constants_1.TEXT_NGRAM_SIZE);
+    const features = ngrams.map(s => BigInt((0, js_xxhash_1.xxHash32)(s) >>> 0));
+    const hash_digest = (0, minhash_1.algMinhash256)(features);
+    return hash_digest;
+}
+//# sourceMappingURL=code-content-text.js.map

package/lib/cjs/code-content-text.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-content-text.js","sourceRoot":"","sources":["../../src/code-content-text.ts"],"names":[],"mappings":";;AAeA,sCAgBC;AASD,4CA2BC;AA0BD,8CAQC;AApGD,2CAA8C;AAC9C,mEAAwD;AACxD,mCAAyC;AACzC,uCAA0C;AAC1C,yCAAqC;AACrC,mCAA2C;AAC3C,2CAKqB;AAGrB,SAAgB,aAAa,CACzB,IAAY,EACZ,IAAa,EACb,OAAgB;IAKhB,IAAI,CAAC,OAAO,EAAE,CAAC;QACX,OAAO,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACf,OAAO,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;SAAM,CAAC;QACJ,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACxD,CAAC;AACL,CAAC;AAED;;;;;EAKE;AAEF,SAAgB,gBAAgB,CAC7B,IAAY,EACZ,IAAa;IAQZ,IAAI,GAAG,IAAA,qCAAa,EAAC,IAAI,CAAC,CAAC;IAC3B,MAAM,UAAU,GAAG,IAAI,CAAA,CAAC,CAAA,IAAI,CAAC,MAAM,CAAA,CAAC,CAAA,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACpE,MAAM,SAAS,GAAG,IAAA,wBAAgB,EAC9B,qBAAS,CAAC,OAAO,EACjB,oBAAQ,CAAC,IAAI,EACb,mBAAO,CAAC,EAAE,EACV,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,qBAAS;IACvB,2GAA2G;IAC3G,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAC5C,CAAC;IAEF,MAAM,IAAI,GAAG,OAAO,GAAG,SAAS,CAAC;IACjC,OAAO;QACH,IAAI,EAAE,IAAI;QACV,UAAU,EAAE,UAAU;KACzB,CAAC;AACN,CAAC;AAGD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAgB,iBAAiB,CAC7B,IAAY;IAGZ,MAAM,MAAM,GAAG,IAAA,sBAAc,EAAC,IAAI,EAAE,2BAAe,CAAC,CAAC;IACrD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,IAAA,oBAAQ,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,WAAW,GAAG,IAAA,uBAAa,EAAC,QAAQ,CAAC,CAAC;IAC5C,OAAO,WAAW,CAAC;AACvB,CAAC","sourcesContent":["\nimport { TEXT_NGRAM_SIZE } from './constants';\nimport { text_collapse } from './content-normalization';\nimport { sliding_window } from './utils';\nimport { algMinhash256 } from './minhash';\nimport { xxHash32 } from 'js-xxhash';\nimport { encode_component } from './codec';\nimport {\n    MainTypes,\n    SubTypes,\n    TEXT_BITS,\n    Version\n} from './constants';\n\n\nexport function gen_text_code(\n    text: string,\n    bits?: number,\n    version?: number\n): { \n    iscc: string;\n    characters: number;\n    } {\n    if (!version) {\n        version = 0;\n    }\n    if (version == 0) {\n        return gen_text_code_v0(text, bits);\n    } else {\n        throw new Error('Only ISCC version 0 is supported');\n    }\n}\n\n/**\n*\n* @param name\n* @param description\n* @returns\n*/\n\nexport function gen_text_code_v0(\n   text: string,\n   bits?: number\n):{ \niscc: string;\ncharacters: number;\n} {\n\n\n    \n    text = text_collapse(text);\n    const characters = text?text.length:0;\n    const digest = Buffer.from(soft_hash_text_v0(text)).toString('hex');\n    const text_code = encode_component(\n        MainTypes.CONTENT,\n        SubTypes.TEXT,\n        Version.V0,\n        bits ? bits : TEXT_BITS,\n        // fix bug https://github.com/nodejs/node/issues/21242 https://github.com/merkletreejs/merkletreejs/pull/91\n        digest.length % 2 ? '0' + digest : digest\n    );\n\n    const iscc = 'ISCC:' + text_code;\n    return {\n        iscc: iscc,\n        characters: characters\n    };\n}\n\n\n/**\n * \n * \n *     Creates a 256-bit similarity preserving hash for text input with algorithm v0.\n\n    - Slide over text with a\n      [`text_ngram_size`][iscc_core.options.CoreOptions.text_ngram_size] wide window\n      and create [`xxh32`](https://cyan4973.github.io/xxHash/) hashes\n    - Create a [`minhash_256`][iscc_core.minhash.alg_minhash_256] from the hashes generated\n      in the previous step.\n\n    !!! note\n\n        Before passing text to this function it must be:\n\n        - stripped of markup\n        - normalized\n        - stripped of whitespace\n        - lowercased\n\n * @param text \n * @returns \n */\nexport function soft_hash_text_v0(\n    text: string\n): Uint8Array {\n\n    const ngrams = sliding_window(text, TEXT_NGRAM_SIZE);\n    const features = ngrams.map(s => BigInt(xxHash32(s) >>> 0));\n    const hash_digest = algMinhash256(features);\n    return hash_digest;\n}\n\n"]}

package/lib/cjs/code-content-video.d.ts

@@ -0,0 +1,19 @@
+/**
+ *
+*The Content-Code Audio is generated from a Chromaprint fingerprint provided as a vector of 32-bit
+signed integers. The [iscc-sdk](https://github.com/iscc/iscc-sdk) uses
+[fpcalc](https://acoustid.org/chromaprint) to extract Chromaprint vectors with the following
+command line parameters:
+
+`$ fpcalc -raw -json -signed -length 0 myaudiofile.mp3`
+ */
+type FrameSig = number[];
+export declare const WTA_VIDEO_ID_PERMUTATIONS: [number, number][];
+export declare function gen_video_code(frame_sigs: FrameSig[], bits?: number, version?: number): {
+    iscc: string;
+};
+export declare function gen_video_code_v0(frameSigs: FrameSig[], bits?: number): {
+    iscc: string;
+};
+export declare function soft_hash_video_v0(frameSigs: FrameSig[], bits?: number): Uint8Array;
+export {};