Buckets:
| import { bigEndian } from "@oslojs/binary"; | |
| import { rotr32 } from "@oslojs/binary"; | |
| export function sha224(data) { | |
| const hash = new SHA224(); | |
| hash.update(data); | |
| return hash.digest(); | |
| } | |
| export class SHA224 { | |
| blockSize = 64; | |
| size = 32; | |
| blocks = new Uint8Array(64); | |
| currentBlockSize = 0; | |
| H = new Uint32Array([ | |
| 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 | |
| ]); | |
| l = 0n; | |
| w = new Uint32Array(64); | |
| update(data) { | |
| this.l += BigInt(data.byteLength) * 8n; | |
| if (this.currentBlockSize + data.byteLength < 64) { | |
| this.blocks.set(data, this.currentBlockSize); | |
| this.currentBlockSize += data.byteLength; | |
| return; | |
| } | |
| let processed = 0; | |
| if (this.currentBlockSize > 0) { | |
| const next = data.slice(0, 64 - this.currentBlockSize); | |
| this.blocks.set(next, this.currentBlockSize); | |
| this.process(); | |
| processed += next.byteLength; | |
| this.currentBlockSize = 0; | |
| } | |
| while (processed + 64 <= data.byteLength) { | |
| const next = data.slice(processed, processed + 64); | |
| this.blocks.set(next); | |
| this.process(); | |
| processed += 64; | |
| } | |
| if (data.byteLength - processed > 0) { | |
| const remaining = data.slice(processed); | |
| this.blocks.set(remaining); | |
| this.currentBlockSize = remaining.byteLength; | |
| } | |
| } | |
| digest() { | |
| this.blocks[this.currentBlockSize] = 0x80; | |
| this.currentBlockSize += 1; | |
| if (64 - this.currentBlockSize < 8) { | |
| this.blocks.fill(0, this.currentBlockSize); | |
| this.process(); | |
| this.currentBlockSize = 0; | |
| } | |
| this.blocks.fill(0, this.currentBlockSize); | |
| bigEndian.putUint64(this.blocks, this.l, this.blockSize - 8); | |
| this.process(); | |
| const result = new Uint8Array(28); | |
| for (let i = 0; i < 7; i++) { | |
| bigEndian.putUint32(result, this.H[i], i * 4); | |
| } | |
| return result; | |
| } | |
| process() { | |
| for (let t = 0; t < 16; t++) { | |
| this.w[t] = | |
| ((this.blocks[t * 4] << 24) | | |
| (this.blocks[t * 4 + 1] << 16) | | |
| (this.blocks[t * 4 + 2] << 8) | | |
| this.blocks[t * 4 + 3]) >>> | |
| 0; | |
| } | |
| for (let t = 16; t < 64; t++) { | |
| const sigma1 = (rotr32(this.w[t - 2], 17) ^ rotr32(this.w[t - 2], 19) ^ (this.w[t - 2] >>> 10)) >>> 0; | |
| const sigma0 = (rotr32(this.w[t - 15], 7) ^ rotr32(this.w[t - 15], 18) ^ (this.w[t - 15] >>> 3)) >>> 0; | |
| this.w[t] = (sigma1 + this.w[t - 7] + sigma0 + this.w[t - 16]) | 0; | |
| } | |
| let a = this.H[0]; | |
| let b = this.H[1]; | |
| let c = this.H[2]; | |
| let d = this.H[3]; | |
| let e = this.H[4]; | |
| let f = this.H[5]; | |
| let g = this.H[6]; | |
| let h = this.H[7]; | |
| for (let t = 0; t < 64; t++) { | |
| const sigma1 = (rotr32(e, 6) ^ rotr32(e, 11) ^ rotr32(e, 25)) >>> 0; | |
| const ch = ((e & f) ^ (~e & g)) >>> 0; | |
| const t1 = (h + sigma1 + ch + K[t] + this.w[t]) | 0; | |
| const sigma0 = (rotr32(a, 2) ^ rotr32(a, 13) ^ rotr32(a, 22)) >>> 0; | |
| const maj = ((a & b) ^ (a & c) ^ (b & c)) >>> 0; | |
| const t2 = (sigma0 + maj) | 0; | |
| h = g; | |
| g = f; | |
| f = e; | |
| e = (d + t1) | 0; | |
| d = c; | |
| c = b; | |
| b = a; | |
| a = (t1 + t2) | 0; | |
| } | |
| this.H[0] = (a + this.H[0]) | 0; | |
| this.H[1] = (b + this.H[1]) | 0; | |
| this.H[2] = (c + this.H[2]) | 0; | |
| this.H[3] = (d + this.H[3]) | 0; | |
| this.H[4] = (e + this.H[4]) | 0; | |
| this.H[5] = (f + this.H[5]) | 0; | |
| this.H[6] = (g + this.H[6]) | 0; | |
| this.H[7] = (h + this.H[7]) | 0; | |
| } | |
| } | |
| const K = new Uint32Array([ | |
| 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, | |
| 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, | |
| 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, | |
| 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, | |
| 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, | |
| 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, | |
| 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, | |
| 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 | |
| ]); | |
Xet Storage Details
- Size:
- 4.77 kB
- Xet hash:
- 28f2ed1f074ad5303a450efeb92f01e210c160f15600c4a12c28a4bfd5cd5deb
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.