29:null 2a:["$","title",null,{"children":"SHA-1 in the Browser | Mikhail Kotelnikov | Observable"}] 2f:T1f70,/** * This method contains the implementation of the SHA1 algorithm copied from [js-sha1](https://github.com/emn178/js-sha1) library (MIT License). * If this method is used with parameters - with one or more byte arrays - then it directly returns the resulting hash. * If there is no parameters for this method then it returns an update function which can be called multiple times to update the internal digest. The chained "finalize" function returns the resulting hash. * * ```javascript * const encoder = new TextEncoder(); * const token1 = encoder.encode("Hello"); * const token2 = encoder.encode(" "); * const token3 = encoder.encode("World"); * * let sha1; * * // Example 1: chained methods calls * sha1 = newSha1() * .update(token1) * .update(token2) * .update(token3) * .finalize(); * * // Example 2: all arrays are transferred directly to the `newSha1` method * const sha1 = newSha1(token1, token2, token3) * ``` */ function newSha1(message) { /* * [js-sha1]{@link https://github.com/emn178/js-sha1} * * @version 0.6.0 * @author Chen, Yi-Cyuan [emn178@gmail.com] * @copyright Chen, Yi-Cyuan 2014-2017 * @license MIT */ const EXTRA = [-2147483648, 8388608, 32768, 128]; const SHIFT = [24, 16, 8, 0]; const blocks = []; blocks[0] = blocks[16] = blocks[1] = blocks[2] = blocks[3] = blocks[4] = blocks[5] = blocks[6] = blocks[7] = blocks[8] = blocks[9] = blocks[10] = blocks[11] = blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0; let h0 = 0x67452301; let h1 = 0xefcdab89; let h2 = 0x98badcfe; let h3 = 0x10325476; let h4 = 0xc3d2e1f0; let block = 0; let start = 0; let bytes = 0; let hBytes = 0; let finalized = false; let hashed = false; let first = true; let lastByteIndex; function checkFinalized() { if (finalized) throw new Error("Hash was finalized"); } function update(message) { if (!arguments.length) { return update; } checkFinalized(); let code, index = 0, i, length = message.length || 0; while (index < length) { if (hashed) { hashed = false; blocks[0] = block; blocks[16] = blocks[1] = blocks[2] = blocks[3] = blocks[4] = blocks[5] = blocks[6] = blocks[7] = blocks[8] = blocks[9] = blocks[10] = blocks[11] = blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0; } for (i = start; index < length && i < 64; ++index) { blocks[i >> 2] |= message[index] << SHIFT[i++ & 3]; } lastByteIndex = i; bytes += i - start; if (i >= 64) { block = blocks[16]; start = i - 64; hash(); hashed = true; } else { start = i; } } if (bytes > 4294967295) { hBytes += (bytes / 4294967296) << 0; bytes = bytes % 4294967296; } return update; } function finalize() { checkFinalized(); finalized = true; let i = lastByteIndex; blocks[16] = block; blocks[i >> 2] |= EXTRA[i & 3]; block = blocks[16]; if (i >= 56) { if (!hashed) { hash(); } blocks[0] = block; blocks[16] = blocks[1] = blocks[2] = blocks[3] = blocks[4] = blocks[5] = blocks[6] = blocks[7] = blocks[8] = blocks[9] = blocks[10] = blocks[11] = blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0; } blocks[14] = (hBytes << 3) | (bytes >>> 29); blocks[15] = bytes << 3; hash(); return [ (h0 >> 24) & 0xff, (h0 >> 16) & 0xff, (h0 >> 8) & 0xff, h0 & 0xff, (h1 >> 24) & 0xff, (h1 >> 16) & 0xff, (h1 >> 8) & 0xff, h1 & 0xff, (h2 >> 24) & 0xff, (h2 >> 16) & 0xff, (h2 >> 8) & 0xff, h2 & 0xff, (h3 >> 24) & 0xff, (h3 >> 16) & 0xff, (h3 >> 8) & 0xff, h3 & 0xff, (h4 >> 24) & 0xff, (h4 >> 16) & 0xff, (h4 >> 8) & 0xff, h4 & 0xff ]; } function hash() { var a = h0, b = h1, c = h2, d = h3, e = h4; var f, j, t; for (j = 16; j < 80; ++j) { t = blocks[j - 3] ^ blocks[j - 8] ^ blocks[j - 14] ^ blocks[j - 16]; blocks[j] = (t << 1) | (t >>> 31); } for (j = 0; j < 20; j += 5) { f = (b & c) | (~b & d); t = (a << 5) | (a >>> 27); e = (t + f + e + 1518500249 + blocks[j]) << 0; b = (b << 30) | (b >>> 2); f = (a & b) | (~a & c); t = (e << 5) | (e >>> 27); d = (t + f + d + 1518500249 + blocks[j + 1]) << 0; a = (a << 30) | (a >>> 2); f = (e & a) | (~e & b); t = (d << 5) | (d >>> 27); c = (t + f + c + 1518500249 + blocks[j + 2]) << 0; e = (e << 30) | (e >>> 2); f = (d & e) | (~d & a); t = (c << 5) | (c >>> 27); b = (t + f + b + 1518500249 + blocks[j + 3]) << 0; d = (d << 30) | (d >>> 2); f = (c & d) | (~c & e); t = (b << 5) | (b >>> 27); a = (t + f + a + 1518500249 + blocks[j + 4]) << 0; c = (c << 30) | (c >>> 2); } for (; j < 40; j += 5) { f = b ^ c ^ d; t = (a << 5) | (a >>> 27); e = (t + f + e + 1859775393 + blocks[j]) << 0; b = (b << 30) | (b >>> 2); f = a ^ b ^ c; t = (e << 5) | (e >>> 27); d = (t + f + d + 1859775393 + blocks[j + 1]) << 0; a = (a << 30) | (a >>> 2); f = e ^ a ^ b; t = (d << 5) | (d >>> 27); c = (t + f + c + 1859775393 + blocks[j + 2]) << 0; e = (e << 30) | (e >>> 2); f = d ^ e ^ a; t = (c << 5) | (c >>> 27); b = (t + f + b + 1859775393 + blocks[j + 3]) << 0; d = (d << 30) | (d >>> 2); f = c ^ d ^ e; t = (b << 5) | (b >>> 27); a = (t + f + a + 1859775393 + blocks[j + 4]) << 0; c = (c << 30) | (c >>> 2); } for (; j < 60; j += 5) { f = (b & c) | (b & d) | (c & d); t = (a << 5) | (a >>> 27); e = (t + f + e - 1894007588 + blocks[j]) << 0; b = (b << 30) | (b >>> 2); f = (a & b) | (a & c) | (b & c); t = (e << 5) | (e >>> 27); d = (t + f + d - 1894007588 + blocks[j + 1]) << 0; a = (a << 30) | (a >>> 2); f = (e & a) | (e & b) | (a & b); t = (d << 5) | (d >>> 27); c = (t + f + c - 1894007588 + blocks[j + 2]) << 0; e = (e << 30) | (e >>> 2); f = (d & e) | (d & a) | (e & a); t = (c << 5) | (c >>> 27); b = (t + f + b - 1894007588 + blocks[j + 3]) << 0; d = (d << 30) | (d >>> 2); f = (c & d) | (c & e) | (d & e); t = (b << 5) | (b >>> 27); a = (t + f + a - 1894007588 + blocks[j + 4]) << 0; c = (c << 30) | (c >>> 2); } for (; j < 80; j += 5) { f = b ^ c ^ d; t = (a << 5) | (a >>> 27); e = (t + f + e - 899497514 + blocks[j]) << 0; b = (b << 30) | (b >>> 2); f = a ^ b ^ c; t = (e << 5) | (e >>> 27); d = (t + f + d - 899497514 + blocks[j + 1]) << 0; a = (a << 30) | (a >>> 2); f = e ^ a ^ b; t = (d << 5) | (d >>> 27); c = (t + f + c - 899497514 + blocks[j + 2]) << 0; e = (e << 30) | (e >>> 2); f = d ^ e ^ a; t = (c << 5) | (c >>> 27); b = (t + f + b - 899497514 + blocks[j + 3]) << 0; d = (d << 30) | (d >>> 2); f = c ^ d ^ e; t = (b << 5) | (b >>> 27); a = (t + f + a - 899497514 + blocks[j + 4]) << 0; c = (c << 30) | (c >>> 2); } h0 = (h0 + a) << 0; h1 = (h1 + b) << 0; h2 = (h2 + c) << 0; h3 = (h3 + d) << 0; h4 = (h4 + e) << 0; } update.finalize = finalize; update.update = update; if (arguments.length) { for (let i = 0; i < arguments.length; i++) { update(arguments[i]); } return finalize(); } else { return update; } }30:[] 2d:{"id":"f8aabe0def7ada25","slug":"sha-1-in-the-browser","title":"SHA-1 in the Browser","thumbnail":"4eedf777ff5c85359447fc4474357a5cee62a6cfda82212738018d11b4d093d4","access_level":"public","create_time":"$D2023-09-30T12:59:21.826Z","update_time":"$D2025-12-05T13:37:19.165Z","view_time":null,"first_public_time":"$D2023-09-30T14:22:56.839Z","has_unpublished_edits":null,"fork":true,"stars":1,"starred":false,"owner":{"type":"team","id":"d4c65cdf77f8f4fd","login":"kotelnikov","name":"Mikhail Kotelnikov","avatar_url":"https://avatars-next.observableusercontent.com/529fa53c5b4acc1414273473d4e049e502c44c1bdbb1a0af81f7faa463dcff4f","tier":"starter_2024"},"version":489,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"cdbfd308e8310490","login":"kotelnikov","name":"Mikhail Kotelnikov","avatar_url":"https://avatars-next.observableusercontent.com/529fa53c5b4acc1414273473d4e049e502c44c1bdbb1a0af81f7faa463dcff4f","tier":null}],"members":[{"type":"individual","id":"cdbfd308e8310490","login":"kotelnikov","name":"Mikhail Kotelnikov","avatar_url":"https://avatars-next.observableusercontent.com/529fa53c5b4acc1414273473d4e049e502c44c1bdbb1a0af81f7faa463dcff4f","tier":null,"role":"editor"}],"comments":[{"id":"5e5c5fea48205701","reply_to_id":null,"content":"you should add MIT license to this notebook. Very cool your brought it here!","create_time":"$D2025-12-01T19:37:17.301Z","update_time":null,"resolved":false,"user":{"type":"individual","id":"5215f6ec4a999d40","login":"tomlarkworthy","name":"Tom Larkworthy","avatar_url":"https://avatars-next.observableusercontent.com/47327a8bc1966f2186dcb3ebf4b7ee6e4e7ab9a5c2a07405aff57200ea778f71","tier":null}},{"id":"617dddbd0e4db7cd","reply_to_id":"5e5c5fea48205701","content":"Thanks for the suggestion! Done.","create_time":"$D2025-12-05T13:33:29.621Z","update_time":null,"resolved":false,"user":{"type":"individual","id":"cdbfd308e8310490","login":"kotelnikov","name":"Mikhail Kotelnikov","avatar_url":"https://avatars-next.observableusercontent.com/529fa53c5b4acc1414273473d4e049e502c44c1bdbb1a0af81f7faa463dcff4f","tier":null}}],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"SHA-1 in the Browser","cells":[{"id":0,"value":"# SHA-1 in the Browser\n\nThis notebook contains methods to generate SHA-1 hashes using pure JS.\n\nMethods:\n* `sha1(message)` - accepts a string and returns HEX-encoded SHA-1 hash\n* `newSha1()` - accepts a binary array and returns an object with the following methods allowing to calculate SHA-1 hash:\n * `update(array)` - updates the internal hash\n * `finalize()` - finalizes digest calculations and returns a binary array with the hash\n* to hex / from hex encoding:\n - `toHex(array)` - encode the given binary array and returns the corresponding HEX string\n - `fromHex(string)` - gets a HEX-encoded string and returns a binary array with the content\n","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":481,"value":"Simple usage: calculate the HEX-encodied SHA-1 digest:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":22,"value":"hash = sha1(\"Hello\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":483,"value":"An example of digest calculations for multiple binary chunks:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":72,"value":"{\n const encoder = new TextEncoder();\n const token1 = encoder.encode(\"Hello\");\n const token2 = encoder.encode(\" \");\n const token3 = encoder.encode(\"World\");\n\n // Example 1: chained methods calls\n const hash1 = newSha1()\n .update(token1)\n .update(token2)\n .update(token3)\n .finalize();\n\n const hash2 = newSha1(token1, token2, token3);\n\n return {\n hash1,\n hash2\n };\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":70,"value":"## SHA-1 Calculations","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":68,"value":" This method contains the implementation of the SHA1 algorithm copied from [js-sha1](https://github.com/emn178/js-sha1) library (MIT License).\n If this method is used with parameters - with one or more byte arrays - then it directly returns the resulting hash.\n \n If there is no parameters for this method then it returns an update function which can be called multiple times to update the internal digest. The chained \"finalize\" function returns the resulting hash.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":58,"value":"$2f","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":474,"value":"An utility method accepting a string parameter used to calculate the hash and returns the corresponding HEX-encoded SHA-1 digest:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":5,"value":"function sha1(str) {\n const encoder = new TextEncoder();\n return toHex(newSha1(encoder.encode(str)));\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":137,"value":"## `fromHex / toHex` methods","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":9,"value":"function toHex(array) {\n return Array.from(new Uint8Array(array))\n .map((v) => v.toString(16).padStart(2, \"0\"))\n .join(\"\");\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":18,"value":"function fromHex(hexString) {\n const MAP_HEX = {\n 0: 0,\n 1: 1,\n 2: 2,\n 3: 3,\n 4: 4,\n 5: 5,\n 6: 6,\n 7: 7,\n 8: 8,\n 9: 9,\n a: 10,\n b: 11,\n c: 12,\n d: 13,\n e: 14,\n f: 15,\n A: 10,\n B: 11,\n C: 12,\n D: 13,\n E: 14,\n F: 15\n };\n\n const bytes = new Uint8Array(Math.floor((hexString || \"\").length / 2));\n let i;\n for (i = 0; i < bytes.length; i++) {\n const a = MAP_HEX[hexString[i * 2]];\n const b = MAP_HEX[hexString[i * 2 + 1]];\n if (a === undefined || b === undefined) {\n break;\n }\n bytes[i] = (a << 4) | b;\n }\n return i === bytes.length ? bytes : bytes.slice(0, i);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":7,"value":"fromHex(hash)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":441,"value":"## Utilities","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":364,"value":"function report(action) {\n const start = Date.now();\n try {\n return action();\n } finally {\n const stop = Date.now();\n console.log(`- ${stop - start}ms`);\n }\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W30","stdlib":"1","titling":"auto"}} 2e:"$2d:body"