[developer_]

И да - что бы меня не проклинали те кто когда нибудь зайдёт в этот топик за ответом приведу рабочую функцию:

function sha1(file) {
    let blockstart;
    let i;
    let W = new Array(80);
    let H0 = 0x67452301;
    let H1 = 0xEFCDAB89;
    let H2 = 0x98BADCFE;
    let H3 = 0x10325476;
    let H4 = 0xC3D2E1F0;
    let A, B, C, D, E;
    let temp;
    //~~~
    const fileLen = file.length;
    let wordArray = [];
    //~~~
    for (i = 0; i < fileLen - 3; i += 4) wordArray.push(file[i] << 24 | file[i + 1] << 16 | file[i + 2] << 8 | file[i + 3]);
    //===
    switch (fileLen % 4) {
        case 0:
            i = 0x080000000;
            break;
        case 1:
            i = file[fileLen - 1] << 24 | 0x0800000;
            break;
        case 2:
            i = file[fileLen - 2] << 24 | file[fileLen - 1] << 16 |
                0x08000;
            break;
        case 3:
            i = file[fileLen - 3] << 24 |
                file[fileLen - 2] << 16 |
                file[fileLen - 1] << 8 | 0x80;
            break;
    }
    //===
    wordArray.push(i)
    //===
    while ((wordArray.length % 16) !== 14) wordArray.push(0);
    //===
    wordArray.push(fileLen >>> 29);
    wordArray.push((fileLen << 3) & 0x0ffffffff);
    //===
    const _rotLeft = (n, s) => {
        var t4 = (n << s) | (n >>> (32 - s));
        //>>>>>>
        return t4;
    }
    //~~~
    for (blockstart = 0; blockstart < wordArray.length; blockstart += 16) {
        for (i = 0; i < 16; i++) {
            W[i] = wordArray[blockstart + i];
        }
        for (i = 16; i <= 79; i++) {
            W[i] = _rotLeft(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
        }
        //===
        A = H0;
        B = H1;
        C = H2;
        D = H3;
        E = H4;
        //~~~
        for (i = 0; i <= 19; i++) {
            temp = (_rotLeft(A, 5) + ((B & C) | (~B & D)) + E + W[i] + 0x5A827999) & 0x0ffffffff;
            E = D;
            D = C;
            C = _rotLeft(B, 30);
            B = A;
            A = temp;
        }
        for (i = 20; i <= 39; i++) {
            temp = (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0x6ED9EBA1) & 0x0ffffffff;
            E = D;
            D = C;
            C = _rotLeft(B, 30);
            B = A;
            A = temp;
        }
        for (i = 40; i <= 59; i++) {
            temp = (_rotLeft(A, 5) + ((B & C) | (B & D) | (C & D)) + E + W[i] + 0x8F1BBCDC) & 0x0ffffffff;
            E = D;
            D = C;
            C = _rotLeft(B, 30);
            B = A;
            A = temp;
        }
        for (i = 60; i <= 79; i++) {
            temp = (_rotLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0xCA62C1D6) & 0x0ffffffff;
            E = D;
            D = C;
            C = _rotLeft(B, 30);
            B = A;
            A = temp;
        }
        H0 = (H0 + A) & 0x0ffffffff;
        H1 = (H1 + B) & 0x0ffffffff;
        H2 = (H2 + C) & 0x0ffffffff;
        H3 = (H3 + D) & 0x0ffffffff;
        H4 = (H4 + E) & 0x0ffffffff;
    }
    //====
    const _cvtHex = val => {
        let str = '', v;
        //~~~
        for (let i = 7; i >= 0; i--) {
            v = (val >>> (i * 4)) & 0x0f;
            str += v.toString(16);
        }
        //>>>>>>
        return str;
    }
    //>>>>>>
    return (_cvtHex(H0) + _cvtHex(H1) + _cvtHex(H2) + _cvtHex(H3) + _cvtHex(H4)).toLocaleUpperCase();
}