From ac9a6bfd06e69ee67071b6ad0fabeddb48097155 Mon Sep 17 00:00:00 2001
From: Suzanne Soy <jsmaniac.github@suzanne.soy>
Date: Wed, 6 Oct 2021 13:47:21 +0100
Subject: [PATCH] Temporary files before deleting them

---
 2       |     1 +
 _2      |   546 +
 a       |     1 +
 i2.html | 78967 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
 4 files changed, 79515 insertions(+)
 create mode 100644 2
 create mode 100644 _2
 create mode 100644 a
 create mode 100644 i2.html

diff --git a/2 b/2
new file mode 100644
index 0000000..852b74d
--- /dev/null
+++ b/2
@@ -0,0 +1 @@
+3c68746d6c3e0a3c686561643e0a3c6d65746120687474702d65717569763d22436f6e74656e742d547970652220636f6e74656e743d22746578742f68746d6c3b20636861727365743d7574662d3822202f3e0a3c2f686561643e0a3c626f64793e0a3c7072652069643d2273656c662d737263223e3c2f7072653e0a3c736372697074207372633d227368613235362e6a73223e3c2f7363726970743e0a3c7363726970743e0a66756e6374696f6e20686578566172696e74546f496e74656765722873747229207b0a20207661722073203d20537472696e6728737472293b0a202076617220746f74616c203d20303b0a2020766172206f6666736574203d20313b0a2020666f7220287661722069203d20303b2069203c20732e6c656e6774683b2069202b3d203229207b0a202020207661722062797465203d207061727365496e7428732e737562737472696e6728692c20692b32292c203136293b0a202020207661722069734c617374203d206e756c6c3b0a202020206966202862797465203e3d2031323829207b0a20202020202062797465202d3d203132383b0a20202020202069734c617374203d2066616c73653b0a202020207d20656c7365207b0a20202020202069734c617374203d20747275653b0a202020207d0a20202020746f74616c202b3d2062797465202a206f66667365743b0a202020206f6666736574202a3d204d6174682e706f7728322c37293b0a20207d0a202072657475726e20746f74616c3b0a7d0a0a66756e6374696f6e20686578537472696e67546f496e74656765724c6973742873747229207b0a20207661722073203d20537472696e6728737472293b0a202076617220726573756c74203d205b5d3b0a2020666f7220287661722069203d20303b2069203c20732e6c656e6774683b20692b3d3229207b0a20202020726573756c745b692f325d203d207061727365496e7428732e737562737472696e6728692c20692b32292c203136293b0a20207d0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e20736861323536496e74656765724c697374546f4d756c74696861736828626173652c206c737429207b0a20202f2f203078323020697320746865206c656e677468206f662074686520686173682e0a20207661722069203d20303b0a202076617220726573756c74203d205b5d3b0a20206966202862617365203d3d20333229207b0a202020202f2f20466f7220736f6d6520726561736f6e207468657365206172652070726573656e7420696e2074686520626173653332204349447320627574206e6f7420696e207468652062617365313620434944730a20202020726573756c745b692b2b5d203d207061727365496e7428273031272c203136293b0a20202020726573756c745b692b2b5d203d207061727365496e7428273730272c203136293b0a20207d0a2020726573756c745b692b2b5d203d207061727365496e7428273132272c203136293b0a2020726573756c745b692b2b5d203d207061727365496e7428273230272c203136293b0a2020666f722028766172206a203d20303b206a203c206c73742e6c656e6774683b206a2b2b29207b0a20202020726573756c745b6a2b695d203d206c73745b6a5d3b0a20207d0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e20696e74656765724c697374546f4c6f776572636173654261736531364d756c746962617365286c737429207b0a202076617220726573756c74203d2027273b0a2020666f7220287661722069203d20303b2069203c206c73742e6c656e6774683b20692b2b29207b0a2020202076617220686578203d206c73745b695d2e746f537472696e67283136293b0a20202020696620286865782e6c656e677468203c203229207b20686578203d20273027202b206865783b207d0a20202020726573756c74202b3d206865783b0a20207d0a202072657475726e20276627202b20726573756c743b0a7d0a0a66756e6374696f6e20696e74384c697374546f4269744c697374286c737429207b0a202076617220726573756c74203d205b5d3b0a2020666f7220287661722069203d20303b2069203c206c73742e6c656e6774683b20692b2b29207b0a20202020726573756c745b692a382b305d203d20286c73745b695d20262031323829203f2031203a20303b0a20202020726573756c745b692a382b315d203d20286c73745b695d202620363429203f2031203a20303b0a20202020726573756c745b692a382b325d203d20286c73745b695d202620333229203f2031203a20303b0a20202020726573756c745b692a382b335d203d20286c73745b695d202620313629203f2031203a20303b0a20202020726573756c745b692a382b345d203d20286c73745b695d2026203829203f2031203a20303b0a20202020726573756c745b692a382b355d203d20286c73745b695d2026203429203f2031203a20303b0a20202020726573756c745b692a382b365d203d20286c73745b695d2026203229203f2031203a20303b0a20202020726573756c745b692a382b375d203d20286c73745b695d2026203129203f2031203a20303b0a20207d0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e20626173653332537472696e67546f4269744c6973742873747229207b0a202076617220626173654368617273203d20276162636465666768696a6b6c6d6e6f707172737475767778797a323334353637273b0a20207661722073203d20537472696e6728737472293b0a202076617220726573756c74203d205b5d3b0a2020666f7220287661722069203d20303b2069203c20732e6c656e6774683b20692b2b29207b0a202020207661722070617274203d206261736543686172732e696e6465784f6628735b695d293b0a202020202f2f666f722028766172206a203d20303b206a203c20363b206a2b2b29207b0a202020202f2f2020726573756c745b692a362b6a5d203d2028706172742026204d6174682e706f7728322c20362d312d6a2929203f2031203a20303b0a202020202f2f7d0a20202020726573756c745b692a352b305d203d202870617274202620313629203f2031203a20303b0a20202020726573756c745b692a352b315d203d2028706172742026203829203f2031203a20303b0a20202020726573756c745b692a352b325d203d2028706172742026203429203f2031203a20303b0a20202020726573756c745b692a352b335d203d2028706172742026203229203f2031203a20303b0a20202020726573756c745b692a352b345d203d2028706172742026203129203f2031203a20303b0a20207d0a202072657475726e20726573756c743b0a7d0a0a2f2f2068747470733a2f2f676973742e6769746875622e636f6d2f646961667967692f39306133653830636131633237393332323065352f2c20777466706c0a7661722066726f6d5f623538203d2066756e6374696f6e28532c41297b76617220643d5b5d2c623d5b5d2c692c6a2c632c6e3b666f72286920696e2053297b6a3d302c633d412e696e6465784f6628535b695d293b696628633c302972657475726e20756e646566696e65643b637c7c622e6c656e6774685e693f693a622e707573682830293b7768696c65286a20696e20647c7c63297b6e3d645b6a5d3b6e3d6e3f6e2a35382b633a633b633d6e3e3e383b645b6a5d3d6e253235363b6a2b2b7d7d7768696c65286a2d2d29622e7075736828645b6a5d293b72657475726e206e65772055696e743841727261792862297d3b0a0a66756e6374696f6e20626173653538537472696e67546f486578537472696e672873747229207b0a202076617220626173654368617273203d202731323334353637383941424344454647484a4b4c4d4e505152535455565758595a6162636465666768696a6b6d6e6f707172737475767778797a273b0a202076617220696e7473203d2066726f6d5f62353828537472696e6728737472292c20626173654368617273293b0a202076617220726573756c74203d2027273b0a2020666f7220287661722069203d20303b2069203c20696e74732e6c656e6774683b20692b2b29207b0a2020202076617220686578203d20696e74735b695d2e746f537472696e67283136293b0a20202020696620286865782e6c656e677468203c203229207b20686578203d20273027202b206865783b207d0a20202020726573756c74202b3d206865783b0a20207d0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e20696e74656765724c697374546f4c6f776572636173654261736533324d756c746962617365286c737429207b0a202076617220626173654368617273203d20276162636465666768696a6b6c6d6e6f707172737475767778797a323334353637273b0a202076617220726573756c74203d2027273b0a2020766172206c203d20696e74384c697374546f4269744c697374286c7374293b0a0a2020666f7220287661722069203d20303b2069203c206c2e6c656e6774683b20692b3d203529207b0a2020202076617220676574203d2066756e6374696f6e286a29207b2072657475726e202828692b6a29203c206c2e6c656e67746829203f206c5b692b6a5d203a20303b207d3b0a202020207661722070617274203d20676574283029202a203136202b20676574283129202a2038202b20676574283229202a2034202b20676574283329202a2032202b20676574283429202a20313b0a20202020726573756c74202b3d206261736543686172735b706172745d3b0a20207d0a202072657475726e20276227202b20726573756c743b0a7d0a0a66756e6374696f6e20626173653332537472696e67546f4261736531364c6f776572636173654d756c7469626173652873747229207b0a202076617220626173654368617273203d202730313233343536373839616263646566273b0a202076617220726573756c74203d2027273b0a2020766172206c203d20626173653332537472696e67546f4269744c69737428737472293b0a0a2020666f7220287661722069203d20303b2069203c206c2e6c656e6774683b20692b3d203429207b0a2020202076617220676574203d2066756e6374696f6e286a29207b2072657475726e202828692b6a29203c206c2e6c656e67746829203f206c5b692b6a5d203a20303b207d3b0a202020207661722070617274203d20676574283029202a2038202b20676574283129202a2034202b20676574283229202a2032202b20676574283329202a20313b0a20202020726573756c74202b3d206261736543686172735b706172745d3b0a20207d0a202072657475726e20276627202b20726573756c743b0a7d0a0a66756e6374696f6e20696e7465676572546f486578566172696e74286929207b0a20202f2f20546869732066756e6374696f6e2074616b65732061204a61766153637269707420696e746567657220616e642072657475726e7320612068657861646563696d616c20737472696e6720726570726573656e74696e67207468617420696e746567657220656e636f64656420617320612070726f746f62756620766172696e74206163636f7264696e6720746f207468652072756c6573206578706c61696e65642061740a20202f2f2068747470733a2f2f646576656c6f706572732e676f6f676c652e636f6d2f70726f746f636f6c2d627566666572732f646f63732f656e636f64696e670a202076617220726573756c74203d2027273b0a20206966202869203c203029207b0a202020207468726f7720224e6567617469766520696e7465676572732061726520737570706f7274656420627920566172696e747320627574206e6f74206279207468697320696d706c656d656e746174696f6e2e223b0a20207d20656c7365206966202869203d3d203029207b0a2020202072657475726e20273030273b0a20207d20656c7365207b0a202020207768696c65202869203e203029207b0a2020202020202f2f2047657420746865206c65617374207369676e69666963616e74203720626974732028302e2e31323729206f662074686520696e746567657220616e642073686966742074686520726573740a202020202020766172206c656173745369676e69666963616e7442697473203d20692026203132373b0a20202020202069203d2069203e3e20373b0a2020202020202f2f2069662074686973206973206e6f7420746865206c617374206368756e6b2c2073657420746865206d6f7374207369676e69666963616e742062697420746f20696e6469636174652074686174207468652076616c75652077696c6c20626520636f6e74696e75656420696e20746865206e65787420627974652873292e0a2020202020206966202869203e203029207b206c656173745369676e69666963616e7442697473207c3d203132383b207d0a2020202020202f2f20436f6e7665727420746f2068657861646563696d616c20616e64207061642077697468203020746f206765742074776f20646967697473206966206e65656465640a20202020202076617220686578203d206c656173745369676e69666963616e74426974732e746f537472696e67283136293b0a202020202020696620286865782e6c656e677468203c203229207b20686578203d20273027202b206865783b207d0a202020202020726573756c74202b3d206865783b0a202020207d0a2020202072657475726e20726573756c743b0a20207d0a7d0a0a66756e6374696f6e2075746638537472696e67546f4865782873747229207b0a20202f2f2054686520696e707574206d75737420616c7265616479206265206120737472696e6720666f72207768696368202e63686172436f64654174282920616c776179732072657475726e7320612076616c7565203c3235362028692e652e206120737472696e6720656e636f64656420696e746f207574662d3820616e642074686f73652076616c7565732072652d656e636f64656420696e746f206a617661736372697074277320696e7465726e616c207574662d3136290a20207661722073203d20537472696e6728737472293b0a202076617220726573756c74203d2027273b0a2020666f7220287661722069203d20303b2069203c20732e6c656e6774683b20692b2b29207b0a2020202076617220686578203d20732e63686172436f646541742869292e746f537472696e67283136293b0a20202020696620286865782e6c656e677468203c203229207b20686578203d20273027202b206865783b207d0a20202020726573756c74202b3d206865783b0a20207d0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e2069706673426c6f636b576974684c696e6b73286f626a65637429207b0a20202f2f206f626a6563742073686f756c6420626520616e207b20224c696e6b73223a206c696e6b732c202244617461223a206865782d656e636f64656420737472696e67207d206f626a6563740a20202f2f2041736964652066726f6d20656e636f64696e6720646966666572656e6365732c2069742073686f756c64206d617463682074686520636f6e74656e7473206f6620746865202269706673206f626a65637420676574202d2d646174612d656e636f64696e673d62617365363420516de280a6686173682220636f6d6d616e640a20202f2f0a20202f2f20224c696e6b73222073686f756c6420626520616e206172726179206f66207b202748617368273a2063696476314261736531364c6f776572636173652c202753697a65273a20496e7465676572207d206f626a656374732e0a20202f2f20546869732066756e6374696f6e732072657475726e7320612068657861646563696d616c20737472696e6720776869636820656e636f64657320746865206970667320626c6f636b20776974682074686520676976656e206c696e6b732e0a20202f2f20546869732069732061207061727469616c20696d706c656d656e746174696f6e20776869636820697320626172656c792073756666696369656e7420666f722072652d68617368696e6720612066696c652c206d616e79206f662074686520636f6e666967757261626c652076616c756573206172652068617264636f6465642e0a20202f2f204120516de280a6686173682063616e20626520636f6e76657274656420746f20612022434944763120626173653136206c6f77657263617365222068617368206f6e2074686520636f6d6d616e642d6c696e65207573696e672074686520666f6c6c6f77696e6720636f64653a0a20202f2f202020697066732063696420666f726d6174202d762031202d6220626173653136202d663d27256d2720516de280a6686173680a20202f2f0a20202f2f202246696c65222073686f756c6420626520746865206865782d656e636f6465642028626173652031362c206c6f776572636173652c206e6f207072656669782920646174612c206f72202266616c736522207768656e2074686520656e747279206973206e6f74206120444147206c6561660a20202f2f0a20202f2f2054686520224461746122206669656c6420617320676976656e2062792074686520666f6c6c6f77696e6720636f6d6d616e640a20202f2f20202069706673206f626a65637420676574202d2d646174612d656e636f64696e673d62617365363420516de280a668617368207c206a71202d7220272e4461746127207c20626173653634202d64207c20787864202d70730a20202f2f206973206175746f6d61746963616c6c792067656e657261746564207573696e6720746865202246696c6522206669656c642069662070726573656e7420616e642074686520766172696f75732073697a6573206574632e0a0a2020766172206c696e6b73203d206f626a6563742e4c696e6b733b0a20207661722066696c65486578203d206f626a6563742e46696c653b0a202076617220726573756c74203d2027273b0a0a2020666f7220287661722069203d20303b2069203c206c696e6b732e6c656e6774683b20692b2b29207b0a2020202076617220636964203d206c696e6b735b695d2e486173683b0a202020207661722073697a65203d206c696e6b735b695d2e53697a653b0a20202020766172206e616d65203d206c696e6b735b695d2e4e616d653b0a202020207661722066696c65486578203d206f626a6563742e46696c653b0a0a20202020726573756c74202b3d20273132273b0a0a2020202076617220656e636f6465644c696e6b203d2027270a202020202f2f20536f6d6520736f7274206f6620736570617261746f72206f72207465726d696e61746f720a20202020656e636f6465644c696e6b202b3d20273061273b0a0a202020202f2f2073697a65206f66207468652043494420283332206279746573202b203220627974657320686561646572203d203334206279746573203d20323220696e20686578290a20202020656e636f6465644c696e6b202b3d20273232273b0a0a20202020696620286369645b305d20213d20276627207c7c206369642e6c656e67746820213d20363929207b0a202020202020696620286369645b305d203d3d20275127202626206369645b315d203d3d20276d27202626206369642e6c656e677468203d3d20343629207b0a2020202020202020636964203d20276627202b20626173653538537472696e67546f486578537472696e6728636964293b0a2020202020202020696620286369645b305d20213d20276627207c7c206369642e6c656e67746820213d20363929207b0a202020202020202020207468726f772022496e7465726e616c206572726f72223b0a20202020202020207d0a2020202020207d20656c7365207b0a20202020202020207468726f77202245787065637465642061206c6f7765726361736520626173653136204349447631206f72206120516de280a66861736820696e2062617365353820286c656e677468203436292e205468652062617365313620656e636f64696e672073686f756c6420737461727420776974682027662722202b0a20202020202020202f2a2b2a2f202220616e6420686176652061206c656e677468206f66203332206279746573202836342068657861646563696d616c20636861726163746572732920706c757320746865206c656164696e6720707265666978202766313232302720286c656e677468206f66203639206368617261637465727320696e20746f74616c2922202b0a20202020202020202f2a2b2a2f20222061732064657363726962656420696e2068747470733a2f2f6769746875622e636f6d2f6d756c7469666f726d6174732f6d756c7469626173652e2054686520676976656e2068617368207374617274656420776974682022202b206369645b305d202b202220616e64206861642061206c656e677468206f662022202b206369642e6c656e6774683b0a2020202020207d0a202020207d0a0a202020202f2f2041646420746865204349442e0a20202020656e636f6465644c696e6b202b3d206369642e737562737472696e672831293b0a0a202020202f2f204164642061207365636f6e642068617264636f6465642070617274206f662074686520656e636f64696e672e0a20202020656e636f6465644c696e6b202b3d20273132273b0a202020202f2f206c656e677468206f662066696c656e616d650a20202020656e636f6465644c696e6b202b3d20696e7465676572546f486578566172696e74286e616d652e6c656e677468293b0a20202020656e636f6465644c696e6b202b3d2075746638537472696e67546f486578286e616d65293b0a0a20202020656e636f6465644c696e6b202b3d20273138273b0a0a202020202f2f20416464207468652073697a652e0a20202020656e636f6465644c696e6b202b3d20696e7465676572546f486578566172696e742873697a65293b0a0a2020202076617220656e636f6465644c696e6b53697a65203d20656e636f6465644c696e6b2e6c656e6774682f320a20202020726573756c74202b3d20696e7465676572546f486578566172696e7428656e636f6465644c696e6b53697a65293b0a20202020726573756c74202b3d20656e636f6465644c696e6b3b0a20207d0a0a20202f2f2047656e65726174652074686520224461746122206669656c640a0a202076617220746f74616c53697a65203d202866696c65486578207c7c202727292e6c656e677468202f20323b0a2020666f7220287661722069203d20303b2069203c206f626a6563742e4c696e6b732e6c656e6774683b20692b2b29207b0a20202020746f74616c53697a65202b3d206f626a6563742e4c696e6b735b695d2e436f6e74656e7453697a653b0a20207d0a0a202076617220656e636f64656444617461203d2027273b0a2020696620286f626a6563742e697346696c6529207b0a202020202f2f2020202020202020202020202027303827202020273032270a20202020656e636f64656444617461202b3d2027303827202b20273032273b0a202020202f2f206669656c64203132207365656d7320746f206265206f7074696f6e616c2028666f7220444147206e6f6465732077697468206c696e6b73202867726f757073206f6620626c6f636b7320616e64206469726563746f7269657329290a202020206966202866696c6548657820213d3d2066616c736529207b0a202020202020656e636f64656444617461202b3d20273132273b0a202020202020656e636f64656444617461202b3d20696e7465676572546f486578566172696e7428746f74616c53697a65293b0a202020202020656e636f64656444617461202b3d2066696c654865783b0a202020207d0a202020202f2f20202020202020202020202027313827205b3866206230203135203d20746f74616c2073697a65206f6620636f6e74656e7473206f66207468652066696c65203d2033353032323330305d0a20202020656e636f64656444617461202b3d2027313827202b20696e7465676572546f486578566172696e7428746f74616c53697a65293b0a20202020666f722028766172206a203d20303b206a203c206f626a6563742e4c696e6b732e6c656e6774683b206a2b2b29207b0a2020202020202f2f203230205b3830203830203130203d2073697a65206f6620636f6e74656e7473206f6620626c6f636b2031203d203236323134345d0a2020202020202f2f203230205b3866206230203035203d2073697a65206f6620636f6e74656e7473206f6620626c6f636b2032203d2038383037395d0a202020202020656e636f64656444617461202b3d20273230273b0a202020202020656e636f64656444617461202b3d20696e7465676572546f486578566172696e74286f626a6563742e4c696e6b735b6a5d2e436f6e74656e7453697a65293b0a202020207d0a20207d20656c7365207b0a202020202f2f206469726563746f72790a20202020656e636f64656444617461202b3d2027303827202b20273031273b0a20207d0a0a20202f2f20536f6d6520736f7274206f6620736570617261746f72206f72207465726d696e61746f720a2020726573756c74202b3d20273061273b0a202076617220656e636f6465644461746153697a65203d20656e636f646564446174612e6c656e677468202f20323b0a2020726573756c74202b3d20696e7465676572546f486578566172696e7428656e636f6465644461746153697a65293b0a2020726573756c74202b3d20656e636f646564446174613b0a0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e206970667348617368576974684c696e6b7328626173652c206f626a65637429207b0a202076617220626c6f636b203d20686578537472696e67546f496e74656765724c6973742869706673426c6f636b576974684c696e6b73286f626a65637429293b0a20207661722068617368203d20736861323536496e74656765724c697374546f4d756c74696861736828626173652c2073686132353628626c6f636b29293b0a20206966202862617365203d3d20313629207b0a2020202072657475726e207b20226861736822203a20696e74656765724c697374546f4c6f776572636173654261736531364d756c7469626173652868617368292c2022626c6f636b22203a20626c6f636b207d3b0a20207d20656c7365207b0a2020202072657475726e207b20226861736822203a20696e74656765724c697374546f4c6f776572636173654261736533324d756c7469626173652868617368292c2022626c6f636b22203a20626c6f636b207d3b0a20207d0a7d0a0a2f2f205265706c6163652074686520666f6c6c6f77696e6720737472696e6720627920225858585f504c414345484f4c4445525f585858222c207468656e20636f6e76657274207468652066696c6520746f2068657861646563696d616c0a2f2f2077697468206865784c696e655769647468206e6962626c657320706572206c696e652c2065616368206c696e6520666f726d617474656420776974686f757420616e7920696e64656e746174696f6e2061730a2f2f20226162636465663030616263646566e280a622202b0a2f2f2065786365707420666f7220746865206c617374206c696e6520666f726d61747465642061730a2f2f20226162636465663030616263646566e280a6223b0a2f2f20616e6420746865206669727374206c696e652077686963682073746172747320696d6d6564696174656c7920616674657220746865203d207369676e2e0a7661722073726331203d20223363363837343664366333653061336336383635363136343365306133633664363537343631323036383734373437303264363537313735363937363364323234333666366537343635366537343264353437393730363532323230363336663665373436353665373433643232373436353738373432663638373436643663336232303633363836313732373336353734336437353734363632643338323222202b0a223230326633653061336332663638363536313634336530613363363236663634373933653061336337303732363532303639363433643232373336353663363632643733373236333232336533633266373037323635336530613363373336333732363937303734323037333732363333643232373336383631333233353336326536613733323233653363326637333633373236393730373433653061336322202b0a223733363337323639373037343365306136363735366536333734363936663665323036383635373835363631373236393665373435343666343936653734363536373635373232383733373437323239323037623061323032303736363137323230373332303364323035333734373236393665363732383733373437323239336230613230323037363631373232303734366637343631366332303364323022202b0a223330336230613230323037363631373232303666363636363733363537343230336432303331336230613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230373332653663363536653637373436383362323036393230326233643230333232393230376230613230323032303230373636313732323036323739373436353230336432303730363122202b0a223732373336353439366537343238373332653733373536323733373437323639366536373238363932633230363932623332323932633230333133363239336230613230323032303230373636313732323036393733346336313733373432303364323036653735366336633362306132303230323032303639363632303238363237393734363532303365336432303331333233383239323037623061323022202b0a223230323032303230323036323739373436353230326433643230333133323338336230613230323032303230323032303639373334633631373337343230336432303636363136633733363533623061323032303230323037643230363536633733363532303762306132303230323032303230323036393733346336313733373432303364323037343732373536353362306132303230323032303764306122202b0a223230323032303230373436663734363136633230326233643230363237393734363532303261323036663636363637333635373433623061323032303230323036663636363637333635373432303261336432303464363137343638326537303666373732383332326333373239336230613230323037643061323032303732363537343735373236653230373436663734363136633362306137643061306122202b0a223636373536653633373436393666366532303638363537383533373437323639366536373534366634393665373436353637363537323463363937333734323837333734373232393230376230613230323037363631373232303733323033643230353337343732363936653637323837333734373232393362306132303230373636313732323037323635373337353663373432303364323035623564336222202b0a223061323032303636366637323230323837363631373232303639323033643230333033623230363932303363323037333265366336353665363737343638336232303639326233643332323932303762306132303230323032303732363537333735366337343562363932663332356432303364323037303631373237333635343936653734323837333265373337353632373337343732363936653637323822202b0a223639326332303639326233323239326332303331333632393362306132303230376430613230323037323635373437353732366532303732363537333735366337343362306137643061306136363735366536333734363936663665323037333638363133323335333634393665373436353637363537323463363937333734353436663464373536633734363936383631373336383238363236313733363522202b0a223263323036633733373432393230376230613230323032663266323033303738333233303230363937333230373436383635323036633635366536373734363832303666363632303734363836353230363836313733363832653061323032303736363137323230363932303364323033303362306132303230373636313732323037323635373337353663373432303364323035623564336230613230323022202b0a223639363632303238363236313733363532303364336432303333333232393230376230613230323032303230326632663230343636663732323037333666366436353230373236353631373336663665323037343638363537333635323036313732363532303730373236353733363536653734323036393665323037343638363532303632363137333635333333323230343334393434373332303632373522202b0a223734323036653666373432303639366532303734363836353230363236313733363533313336323034333439343437333061323032303230323037323635373337353663373435623639326232623564323033643230373036313732373336353439366537343238323733303331323732633230333133363239336230613230323032303230373236353733373536633734356236393262326235643230336422202b0a223230373036313732373336353439366537343238323733373330323732633230333133363239336230613230323037643061323032303732363537333735366337343562363932623262356432303364323037303631373237333635343936653734323832373331333232373263323033313336323933623061323032303732363537333735366337343562363932623262356432303364323037303631373222202b0a223733363534393665373432383237333233303237326332303331333632393362306132303230363636663732323032383736363137323230366132303364323033303362323036613230336332303663373337343265366336353665363737343638336232303661326232623239323037623061323032303230323037323635373337353663373435623661326236393564323033643230366337333734356222202b0a223661356433623061323032303764306132303230373236353734373537323665323037323635373337353663373433623061376430613061363637353665363337343639366636653230363936653734363536373635373234633639373337343534366634633666373736353732363336313733363534323631373336353331333634643735366337343639363236313733363532383663373337343239323022202b0a223762306132303230373636313732323037323635373337353663373432303364323032373237336230613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230366337333734326536633635366536373734363833623230363932623262323932303762306132303230323032303736363137323230363836353738323033643230366337333734356222202b0a223639356432653734366635333734373236393665363732383331333632393362306132303230323032303639363632303238363836353738326536633635366536373734363832303363323033323239323037623230363836353738323033643230323733303237323032623230363836353738336232303764306132303230323032303732363537333735366337343230326233643230363836353738336222202b0a223061323032303764306132303230373236353734373537323665323032373636323732303262323037323635373337353663373433623061376430613061363637353665363337343639366636653230363936653734333834633639373337343534366634323639373434633639373337343238366337333734323932303762306132303230373636313732323037323635373337353663373432303364323022202b0a223562356433623061323032303636366637323230323837363631373232303639323033643230333033623230363932303363323036633733373432653663363536653637373436383362323036393262326232393230376230613230323032303230373236353733373536633734356236393261333832623330356432303364323032383663373337343562363935643230323632303331333233383239323022202b0a223366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333832623331356432303364323032383663373337343562363935643230323632303336333432393230336632303331323033613230333033623061323032303230323037323635373337353663373435623639326133383262333235643230336432303238366337333734356236393564323022202b0a223236323033333332323932303366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333832623333356432303364323032383663373337343562363935643230323632303331333632393230336632303331323033613230333033623061323032303230323037323635373337353663373435623639326133383262333435643230336432303238366322202b0a223733373435623639356432303236323033383239323033663230333132303361323033303362306132303230323032303732363537333735366337343562363932613338326233353564323033643230323836633733373435623639356432303236323033343239323033663230333132303361323033303362306132303230323032303732363537333735366337343562363932613338326233363564323022202b0a223364323032383663373337343562363935643230323632303332323932303366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333832623337356432303364323032383663373337343562363935643230323632303331323932303366323033313230336132303330336230613230323037643061323032303732363537343735373236653230373222202b0a223635373337353663373433623061376430613061363637353665363337343639366636653230363236313733363533333332353337343732363936653637353436663432363937343463363937333734323837333734373232393230376230613230323037363631373232303632363137333635343336383631373237333230336432303237363136323633363436353636363736383639366136623663366422202b0a223665366637303731373237333734373537363737373837393761333233333334333533363337323733623061323032303736363137323230373332303364323035333734373236393665363732383733373437323239336230613230323037363631373232303732363537333735366337343230336432303562356433623061323032303636366637323230323837363631373232303639323033643230333022202b0a223362323036393230336332303733326536633635366536373734363833623230363932623262323932303762306132303230323032303736363137323230373036313732373432303364323036323631373336353433363836313732373332653639366536343635373834663636323837333562363935643239336230613230323032303230326632663636366637323230323837363631373232303661323022202b0a223364323033303362323036613230336332303336336232303661326232623239323037623061323032303230323032663266323032303732363537333735366337343562363932613336326236613564323033643230323837303631373237343230323632303464363137343638326537303666373732383332326332303336326433313264366132393239323033663230333132303361323033303362306122202b0a223230323032303230326632663764306132303230323032303732363537333735366337343562363932613335326233303564323033643230323837303631373237343230323632303331333632393230336632303331323033613230333033623061323032303230323037323635373337353663373435623639326133353262333135643230336432303238373036313732373432303236323033383239323022202b0a223366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333532623332356432303364323032383730363137323734323032363230333432393230336632303331323033613230333033623061323032303230323037323635373337353663373435623639326133353262333335643230336432303238373036313732373432303236323033323239323022202b0a223366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333532623334356432303364323032383730363137323734323032363230333132393230336632303331323033613230333033623061323032303764306132303230373236353734373537323665323037323635373337353663373433623061376430613061326632663230363837343734373022202b0a223733336132663266363736393733373432653637363937343638373536323265363336663664326636343639363136363739363736393266333933303631333336353338333036333631333136333332333733393333333233323330363533353266326332303737373436363730366330613736363137323230363637323666366435663632333533383230336432303636373536653633373436393666366522202b0a223238353332633431323937623736363137323230363433643562356432633632336435623564326336393263366132633633326336653362363636663732323836393230363936653230353332393762366133643330326336333364343132653639366536343635373834663636323835333562363935643239336236393636323836333363333032393732363537343735373236653230373536653634363522202b0a223636363936653635363433623633376337633632326536633635366536373734363835653639336636393361363232653730373537333638323833303239336237373638363936633635323836613230363936653230363437633763363332393762366533643634356236613564336236653364366533663665326133353338326236333361363333623633336436653365336533383362363435623661356422202b0a223364366532353332333533363362366132623262376437643737363836393663363532383661326432643239363232653730373537333638323836343562366135643239336237323635373437353732366532303665363537373230353536393665373433383431373237323631373932383632323937643362306130613636373536653633373436393666366532303632363137333635333533383533373422202b0a223732363936653637353436663438363537383533373437323639366536373238373337343732323932303762306132303230373636313732323036323631373336353433363836313732373332303364323032373331333233333334333533363337333833393431343234333434343534363437343834613462346334643465353035313532353335343535353635373538353935613631363236333634363522202b0a223636363736383639366136623664366536663730373137323733373437353736373737383739376132373362306132303230373636313732323036393665373437333230336432303636373236663664356636323335333832383533373437323639366536373238373337343732323932633230363236313733363534333638363137323733323933623061323032303736363137323230373236353733373522202b0a223663373432303364323032373237336230613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230363936653734373332653663363536653637373436383362323036393262326232393230376230613230323032303230373636313732323036383635373832303364323036393665373437333562363935643265373436663533373437323639366522202b0a223637323833313336323933623061323032303230323036393636323032383638363537383265366336353665363737343638323033633230333232393230376232303638363537383230336432303237333032373230326232303638363537383362323037643061323032303230323037323635373337353663373432303262336432303638363537383362306132303230376430613230323037323635373422202b0a223735373236653230373236353733373536633734336230613764306130613636373536653633373436393666366532303639366537343635363736353732346336393733373435343666346336663737363537323633363137333635343236313733363533333332346437353663373436393632363137333635323836633733373432393230376230613230323037363631373232303632363137333635343322202b0a223638363137323733323033643230323736313632363336343635363636373638363936613662366336643665366637303731373237333734373537363737373837393761333233333334333533363337323733623061323032303736363137323230373236353733373536633734323033643230323732373362306132303230373636313732323036633230336432303639366537343338346336393733373422202b0a223534366634323639373434633639373337343238366337333734323933623061306132303230363636663732323032383736363137323230363932303364323033303362323036393230336332303663326536633635366536373734363833623230363932623364323033353239323037623061323032303230323037363631373232303637363537343230336432303636373536653633373436393666366522202b0a223238366132393230376232303732363537343735373236653230323832383639326236613239323033633230366332653663363536653637373436383239323033663230366335623639326236613564323033613230333033623230376433623061323032303230323037363631373232303730363137323734323033643230363736353734323833303239323032613230333133363230326232303637363522202b0a223734323833313239323032613230333832303262323036373635373432383332323932303261323033343230326232303637363537343238333332393230326132303332323032623230363736353734323833343239323032613230333133623061323032303230323037323635373337353663373432303262336432303632363137333635343336383631373237333562373036313732373435643362306122202b0a223230323037643061323032303732363537343735373236653230323736323237323032623230373236353733373536633734336230613764306130613636373536653633373436393666366532303632363137333635333333323533373437323639366536373534366634323631373336353331333634633666373736353732363336313733363534643735366337343639363236313733363532383733373422202b0a223732323932303762306132303230373636313732323036323631373336353433363836313732373332303364323032373330333133323333333433353336333733383339363136323633363436353636323733623061323032303736363137323230373236353733373536633734323033643230323732373362306132303230373636313732323036633230336432303632363137333635333333323533373422202b0a223732363936653637353436663432363937343463363937333734323837333734373232393362306130613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230366332653663363536653637373436383362323036393262336432303334323932303762306132303230323032303736363137323230363736353734323033643230363637353665363322202b0a223734363936663665323836613239323037623230373236353734373537323665323032383238363932623661323932303363323036633265366336353665363737343638323932303366323036633562363932623661356432303361323033303362323037643362306132303230323032303736363137323230373036313732373432303364323036373635373432383330323932303261323033383230326222202b0a223230363736353734323833313239323032613230333432303262323036373635373432383332323932303261323033323230326232303637363537343238333332393230326132303331336230613230323032303230373236353733373536633734323032623364323036323631373336353433363836313732373335623730363137323734356433623061323032303764306132303230373236353734373522202b0a223732366532303237363632373230326232303732363537333735366337343362306137643061306136363735366536333734363936663665323036393665373436353637363537323534366634383635373835363631373236393665373432383639323932303762306132303230326632663230353436383639373332303636373536653633373436393666366532303734363136623635373332303631323022202b0a223461363137363631353336333732363937303734323036393665373436353637363537323230363136653634323037323635373437353732366537333230363132303638363537383631363436353633363936643631366332303733373437323639366536373230373236353730373236353733363536653734363936653637323037343638363137343230363936653734363536373635373232303635366522202b0a223633366636343635363432303631373332303631323037303732366637343666363237353636323037363631373236393665373432303631363336333666373236343639366536373230373436663230373436383635323037323735366336353733323036353738373036633631363936653635363432303631373430613230323032663266323036383734373437303733336132663266363436353736363522202b0a223663366637303635373237333265363736663666363736633635326536333666366432663730373236663734366636333666366332643632373536363636363537323733326636343666363337333266363536653633366636343639366536373061323032303736363137323230373236353733373536633734323033643230323732373362306132303230363936363230323836393230336332303330323922202b0a223230376230613230323032303230373436383732366637373230323234653635363736313734363937363635323036393665373436353637363537323733323036313732363532303733373537303730366637323734363536343230363237393230353636313732363936653734373332303632373537343230366536663734323036323739323037343638363937333230363936643730366336353664363522202b0a223665373436313734363936663665326532323362306132303230376432303635366337333635323036393636323032383639323033643364323033303239323037623061323032303230323037323635373437353732366532303237333033303237336230613230323037643230363536633733363532303762306132303230323032303737363836393663363532303238363932303365323033303239323022202b0a223762306132303230323032303230323032663266323034373635373432303734363836353230366336353631373337343230373336393637366536393636363936333631366537343230333732303632363937343733323032383330326532653331333233373239323036663636323037343638363532303639366537343635363736353732323036313665363432303733363836393636373432303734363822202b0a223635323037323635373337343061323032303230323032303230373636313732323036633635363137333734353336393637366536393636363936333631366537343432363937343733323033643230363932303236323033313332333733623061323032303230323032303230363932303364323036393230336533653230333733623061323032303230323032303230326632663230363936363230373422202b0a223638363937333230363937333230366536663734323037343638363532303663363137333734323036333638373536653662326332303733363537343230373436383635323036643666373337343230373336393637366536393636363936333631366537343230363236393734323037343666323036393665363436393633363137343635323037343638363137343230373436383635323037363631366322202b0a223735363532303737363936633663323036323635323036333666366537343639366537353635363432303639366532303734363836353230366536353738373432303632373937343635323837333239326530613230323032303230323032303639363632303238363932303365323033303239323037623230366336353631373337343533363936373665363936363639363336313665373434323639373422202b0a223733323037633364323033313332333833623230376430613230323032303230323032303266326632303433366636653736363537323734323037343666323036383635373836313634363536333639366436313663323036313665363432303730363136343230373736393734363832303330323037343666323036373635373432303734373736663230363436393637363937343733323036393636323022202b0a223665363536353634363536343061323032303230323032303230373636313732323036383635373832303364323036633635363137333734353336393637366536393636363936333631366537343432363937343733326537343666353337343732363936653637323833313336323933623061323032303230323032303230363936363230323836383635373832653663363536653637373436383230336322202b0a223230333232393230376232303638363537383230336432303237333032373230326232303638363537383362323037643061323032303230323032303230373236353733373536633734323032623364323036383635373833623061323032303230323037643061323032303230323037323635373437353732366532303732363537333735366337343362306132303230376430613764306130613636373522202b0a223665363337343639366636653230373537343636333835333734373236393665363735343666343836353738323837333734373232393230376230613230323032663266323035343638363532303639366537303735373432303664373537333734323036313663373236353631363437393230363236353230363132303733373437323639366536373230363636663732323037373638363936333638323022202b0a223265363336383631373234333666363436353431373432383239323036313663373736313739373332303732363537343735373236653733323036313230373636313663373536353230336333323335333632303238363932653635326532303631323037333734373236393665363732303635366536333666363436353634323036393665373436663230373537343636326433383230363136653634323022202b0a223734363836663733363532303736363136633735363537333230373236353264363536653633366636343635363432303639366537343666323036613631373636313733363337323639373037343237373332303639366537343635373236653631366332303735373436363264333133363239306132303230373636313732323037333230336432303533373437323639366536373238373337343732323922202b0a223362306132303230373636313732323037323635373337353663373432303364323032373237336230613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230373332653663363536653637373436383362323036393262326232393230376230613230323032303230373636313732323036383635373832303364323037333265363336383631373222202b0a223433366636343635343137343238363932393265373436663533373437323639366536373238333133363239336230613230323032303230363936363230323836383635373832653663363536653637373436383230336332303332323932303762323036383635373832303364323032373330323732303262323036383635373833623230376430613230323032303230373236353733373536633734323022202b0a223262336432303638363537383362306132303230376430613230323037323635373437353732366532303732363537333735366337343362306137643061306136363735366536333734363936663665323036393730363637333432366336663633366235373639373436383463363936653662373332383666363236613635363337343239323037623061323032303266326632303666363236613635363322202b0a223734323037333638366637353663363432303632363532303631366532303762323032323463363936653662373332323361323036633639366536623733326332303232343436313734363132323361323036383635373832643635366536333666363436353634323037333734373236393665363732303764323036663632366136353633373430613230323032663266323034313733363936343635323022202b0a223636373236663664323036353665363336663634363936653637323036343639363636363635373236353665363336353733326332303639373432303733363836663735366336343230366436313734363336383230373436383635323036333666366537343635366537343733323036663636323037343638363532303232363937303636373332303666363236613635363337343230363736353734323022202b0a223264326436343631373436313264363536653633366636343639366536373364363236313733363533363334323035313664653238306136363836313733363832323230363336663664366436313665363430613230323032663266306132303230326632663230323234633639366536623733323232303733363836663735366336343230363236353230363136653230363137323732363137393230366622202b0a223636323037623230323734383631373336383237336132303633363936343736333134323631373336353331333634633666373736353732363336313733363532633230323735333639376136353237336132303439366537343635363736353732323037643230366636323661363536333734373332653061323032303266326632303534363836393733323036363735366536333734363936663665373322202b0a223230373236353734373537323665373332303631323036383635373836313634363536333639366436313663323037333734373236393665363732303737363836393633363832303635366536333666363436353733323037343638363532303639373036363733323036323663366636333662323037373639373436383230373436383635323036373639373636353665323036633639366536623733326522202b0a223061323032303266326632303534363836393733323036393733323036313230373036313732373436393631366332303639366437303663363536643635366537343631373436393666366532303737363836393633363832303639373332303632363137323635366337393230373337353636363636393633363936353665373432303636366637323230373236353264363836313733363836393665363722202b0a223230363132303636363936633635326332303664363136653739323036663636323037343638363532303633366636653636363936373735373236313632366336353230373636313663373536353733323036313732363532303638363137323634363336663634363536343265306132303230326632663230343132303531366465323830613636383631373336383230363336313665323036323635323022202b0a223633366636653736363537323734363536343230373436663230363132303232343334393434373633313230363236313733363533313336323036633666373736353732363336313733363532323230363836313733363832303666366532303734363836353230363336663664366436313665363432643663363936653635323037353733363936653637323037343638363532303636366636633663366622202b0a223737363936653637323036333666363436353361306132303230326632663230323032303639373036363733323036333639363432303636366637323664363137343230326437363230333132303264363232303632363137333635333133363230326436363364323732353664323732303531366465323830613636383631373336383061323032303266326630613230323032663266323032323436363922202b0a223663363532323230373336383666373536633634323036323635323037343638363532303638363537383264363536653633366636343635363432303238363236313733363532303331333632633230366336663737363537323633363137333635326332303665366632303730373236353636363937383239323036343631373436313263323036663732323032323636363136633733363532323230373722202b0a223638363536653230373436383635323036353665373437323739323036393733323036653666373432303631323034343431343732303663363536313636306132303230326632663061323032303266326632303534363836353230323234343631373436313232323036363639363536633634323036313733323036373639373636353665323036323739323037343638363532303636366636633663366622202b0a223737363936653637323036333666366436643631366536343061323032303266326632303230323036393730363637333230366636323661363536333734323036373635373432303264326436343631373436313264363536653633366636343639366536373364363236313733363533363334323035313664653238306136363836313733363832303763323036613731323032643732323032373265343422202b0a223631373436313237323037633230363236313733363533363334323032643634323037633230373837383634323032643730373330613230323032663266323036393733323036313735373436663664363137343639363336313663366337393230363736353665363537323631373436353634323037353733363936653637323037343638363532303232343636393663363532323230363636393635366322202b0a223634323036393636323037303732363537333635366537343230363136653634323037343638363532303736363137323639366637353733323037333639376136353733323036353734363332653061306132303230373636313732323036633639366536623733323033643230366636323661363536333734326534633639366536623733336230613230323037363631373232303636363936633635343822202b0a223635373832303364323036663632366136353633373432653436363936633635336230613230323037363631373232303732363537333735366337343230336432303237323733623061306132303230363636663732323032383736363137323230363932303364323033303362323036393230336332303663363936653662373332653663363536653637373436383362323036393262326232393230376222202b0a223061323032303230323037363631373232303633363936343230336432303663363936653662373335623639356432653438363137333638336230613230323032303230373636313732323037333639376136353230336432303663363936653662373335623639356432653533363937613635336230613230323032303230373636313732323036653631366436353230336432303663363936653662373322202b0a223562363935643265346536313664363533623061323032303230323037363631373232303636363936633635343836353738323033643230366636323661363536333734326534363639366336353362306130613230323032303230373236353733373536633734323032623364323032373331333232373362306130613230323032303230373636313732323036353665363336663634363536343463363922202b0a223665366232303364323032373237306132303230323032303266326632303533366636643635323037333666373237343230366636363230373336353730363137323631373436663732323036663732323037343635373236643639366536313734366637323061323032303230323036353665363336663634363536343463363936653662323032623364323032373330363132373362306130613230323022202b0a223230323032663266323037333639376136353230366636363230373436383635323034333439343432303238333333323230363237393734363537333230326232303332323036323739373436353733323036383635363136343635373232303364323033333334323036323739373436353733323033643230333233323230363936653230363836353738323930613230323032303230363536653633366622202b0a223634363536343463363936653662323032623364323032373332333232373362306130613230323032303230363936363230323836333639363435623330356432303231336432303237363632373230376337633230363336393634326536633635366536373734363832303231336432303336333932393230376230613230323032303230323032303639363632303238363336393634356233303564323022202b0a223364336432303237353132373230323632363230363336393634356233313564323033643364323032373664323732303236323632303633363936343265366336353665363737343638323033643364323033343336323932303762306132303230323032303230323032303230363336393634323033643230323736363237323032623230363236313733363533353338353337343732363936653637353422202b0a223666343836353738353337343732363936653637323836333639363432393362306132303230323032303230323032303230363936363230323836333639363435623330356432303231336432303237363632373230376337633230363336393634326536633635366536373734363832303231336432303336333932393230376230613230323032303230323032303230323032303230373436383732366622202b0a223737323032323439366537343635373236653631366332303635373237323666373232323362306132303230323032303230323032303230376430613230323032303230323032303764323036353663373336353230376230613230323032303230323032303230323037343638373236663737323032323435373837303635363337343635363432303631323036633666373736353732363336313733363522202b0a223230363236313733363533313336323034333439343437363331323036663732323036313230353136646532383061363638363137333638323036393665323036323631373336353335333832303238366336353665363737343638323033343336323932653230353436383635323036323631373336353331333632303635366536333666363436393665363732303733363836663735366336343230373322202b0a223734363137323734323037373639373436383230323736363237323232303262306132303230323032303230323032303230326632613262326132663230323232303631366536343230363836313736363532303631323036633635366536373734363832303666363632303333333232303632373937343635373332303238333633343230363836353738363136343635363336393664363136633230363322202b0a223638363137323631363337343635373237333239323037303663373537333230373436383635323036633635363136343639366536373230373037323635363636393738323032373636333133323332333032373230323836633635366536373734363832303666363632303336333932303633363836313732363136333734363537323733323036393665323037343666373436313663323932323230326222202b0a223061323032303230323032303230323032303266326132623261326632303232323036313733323036343635373336333732363936323635363432303639366532303638373437343730373333613266326636373639373436383735363232653633366636643266366437353663373436393636366637323664363137343733326636643735366337343639363236313733363532653230353436383635323022202b0a223637363937363635366532303638363137333638323037333734363137323734363536343230373736393734363832303232323032623230363336393634356233303564323032623230323232303631366536343230363836313634323036313230366336353665363737343638323036663636323032323230326232303633363936343265366336353665363737343638336230613230323032303230323022202b0a223230376430613230323032303230376430613061323032303230323032663266323034313634363432303734363836353230343334393434326530613230323032303230363536653633366636343635363434633639366536623230326233643230363336393634326537333735363237333734373236393665363732383331323933623061306132303230323032303266326632303431363436343230363122202b0a223230373336353633366636653634323036383631373236343633366636343635363432303730363137323734323036663636323037343638363532303635366536333666363436393665363732653061323032303230323036353665363336663634363536343463363936653662323032623364323032373331333232373362306132303230323032303266326632303663363536653637373436383230366622202b0a223636323036363639366336353665363136643635306132303230323032303635366536333666363436353634346336393665366232303262336432303639366537343635363736353732353436663438363537383536363137323639366537343238366536313664363532653663363536653637373436383239336230613230323032303230363536653633366636343635363434633639366536623230326222202b0a223364323037353734363633383533373437323639366536373534366634383635373832383665363136643635323933623061306132303230323032303635366536333666363436353634346336393665366232303262336432303237333133383237336230613061323032303230323032663266323034313634363432303734363836353230373336393761363532653061323032303230323036353665363322202b0a223666363436353634346336393665366232303262336432303639366537343635363736353732353436663438363537383536363137323639366537343238373336393761363532393362306130613230323032303230373636313732323036353665363336663634363536343463363936653662353336393761363532303364323036353665363336663634363536343463363936653662326536633635366522202b0a223637373436383266333230613230323032303230373236353733373536633734323032623364323036393665373436353637363537323534366634383635373835363631373236393665373432383635366536333666363436353634346336393665366235333639376136353239336230613230323032303230373236353733373536633734323032623364323036353665363336663634363536343463363922202b0a223665366233623061323032303764306130613230323032663266323034373635366536353732363137343635323037343638363532303232343436313734363132323230363636393635366336343061306132303230373636313732323037343666373436313663353336393761363532303364323032383636363936633635343836353738323037633763323032373237323932653663363536653637373422202b0a223638323032663230333233623061323032303636366637323230323837363631373232303639323033643230333033623230363932303363323036663632366136353633373432653463363936653662373332653663363536653637373436383362323036393262326232393230376230613230323032303230373436663734363136633533363937613635323032623364323036663632366136353633373422202b0a223265346336393665366237333562363935643265343336663665373436353665373435333639376136353362306132303230376430613061323032303736363137323230363536653633366636343635363434343631373436313230336432303237323733623061323032303639363632303238366636323661363536333734326536393733343636393663363532393230376230613230323032303230326622202b0a223266323032303230323032303230323032303230323032303230323032373330333832373230323032303237333033323237306132303230323032303635366536333666363436353634343436313734363132303262336432303237333033383237323032623230323733303332323733623061323032303230323032663266323036363639363536633634323033313332323037333635363536643733323022202b0a223734366632303632363532303666373037343639366636653631366332303238363636663732323034343431343732303665366636343635373332303737363937343638323036633639366536623733323032383637373236663735373037333230366636363230363236633666363336623733323036313665363432303634363937323635363337343666373236393635373332393239306132303230323022202b0a223230363936363230323836363639366336353438363537383230323133643364323036363631366337333635323932303762306132303230323032303230323036353665363336663634363536343434363137343631323032623364323032373331333232373362306132303230323032303230323036353665363336663634363536343434363137343631323032623364323036393665373436353637363522202b0a223732353436663438363537383536363137323639366537343238373436663734363136633533363937613635323933623061323032303230323032303230363536653633366636343635363434343631373436313230326233643230363636393663363534383635373833623061323032303230323037643061323032303230323032663266323032303230323032303230323032303230323032303230323722202b0a223331333832373230356233383636323036323330323033313335323033643230373436663734363136633230373336393761363532303666363632303633366636653734363536653734373332303666363632303734363836353230363636393663363532303364323033333335333033323332333333303330356430613230323032303230363536653633366636343635363434343631373436313230326222202b0a223364323032373331333832373230326232303639366537343635363736353732353436663438363537383536363137323639366537343238373436663734363136633533363937613635323933623061323032303230323036363666373232303238373636313732323036613230336432303330336232303661323033633230366636323661363536333734326534633639366536623733326536633635366522202b0a223637373436383362323036613262326232393230376230613230323032303230323032303266326632303332333032303562333833303230333833303230333133303230336432303733363937613635323036663636323036333666366537343635366537343733323036663636323036323663366636333662323033313230336432303332333633323331333433343564306132303230323032303230323022202b0a223266326632303332333032303562333836363230363233303230333033353230336432303733363937613635323036663636323036333666366537343635366537343733323036663636323036323663366636333662323033323230336432303338333833303337333935643061323032303230323032303230363536653633366636343635363434343631373436313230326233643230323733323330323722202b0a223362306132303230323032303230323036353665363336663634363536343434363137343631323032623364323036393665373436353637363537323534366634383635373835363631373236393665373432383666363236613635363337343265346336393665366237333562366135643265343336663665373436353665373435333639376136353239336230613230323032303230376430613230323022202b0a223764323036353663373336353230376230613230323032303230326632663230363436393732363536333734366637323739306132303230323032303635366536333666363436353634343436313734363132303262336432303237333033383237323032623230323733303331323733623061323032303764306130613230323032663266323035333666366436353230373336663732373432303666363622202b0a223230373336353730363137323631373436663732323036663732323037343635373236643639366536313734366637323061323032303732363537333735366337343230326233643230323733303631323733623061323032303736363137323230363536653633366636343635363434343631373436313533363937613635323033643230363536653633366636343635363434343631373436313265366322202b0a223635366536373734363832303266323033323362306132303230373236353733373536633734323032623364323036393665373436353637363537323534366634383635373835363631373236393665373432383635366536333666363436353634343436313734363135333639376136353239336230613230323037323635373337353663373432303262336432303635366536333666363436353634343422202b0a223631373436313362306130613230323037323635373437353732366532303732363537333735366337343362306137643061306136363735366536333734363936663665323036393730363637333438363137333638353736393734363834633639366536623733323836323631373336353263323036663632366136353633373432393230376230613230323037363631373232303632366336663633366222202b0a223230336432303638363537383533373437323639366536373534366634393665373436353637363537323463363937333734323836393730363637333432366336663633366235373639373436383463363936653662373332383666363236613635363337343239323933623061323032303736363137323230363836313733363832303364323037333638363133323335333634393665373436353637363522202b0a223732346336393733373435343666346437353663373436393638363137333638323836323631373336353263323037333638363133323335333632383632366336663633366232393239336230613230323036393636323032383632363137333635323033643364323033313336323932303762306132303230323032303732363537343735373236653230376232303232363836313733363832323230336122202b0a223230363936653734363536373635373234633639373337343534366634633666373736353732363336313733363534323631373336353331333634643735366337343639363236313733363532383638363137333638323932633230323236323663366636333662323232303361323036323663366636333662323037643362306132303230376432303635366337333635323037623061323032303230323022202b0a223732363537343735373236653230376232303232363836313733363832323230336132303639366537343635363736353732346336393733373435343666346336663737363537323633363137333635343236313733363533333332346437353663373436393632363137333635323836383631373336383239326332303232363236633666363336623232323033613230363236633666363336623230376422202b0a223362306132303230376430613764306130613266326632303532363537303663363136333635323037343638363532303636366636633663366637373639366536373230373337343732363936653637323036323739323032323538353835383566353034633431343334353438346634633434343535323566353835383538323232633230373436383635366532303633366636653736363537323734323022202b0a223734363836353230363636393663363532303734366632303638363537383631363436353633363936643631366330613266326632303737363937343638323036383635373834633639366536353537363936343734363832303665363936323632366336353733323037303635373232303663363936653635326332303635363136333638323036633639366536353230363636663732366436313734373422202b0a223635363432303737363937343638366637353734323036313665373932303639366536343635366537343631373436393666366532303631373330613266326632303232363136323633363436353636333033303631363236333634363536366532383061363232323032623061326632663230363537383633363537303734323036363666373232303734363836353230366336313733373432303663363922202b0a223665363532303636366637323664363137343734363536343230363137333061326632663230323236313632363336343635363633303330363136323633363436353636653238306136323233623061326632663230363136653634323037343638363532303636363937323733373432303663363936653635323037373638363936333638323037333734363137323734373332303639366436643635363422202b0a223639363137343635366337393230363136363734363537323230373436383635323033643230373336393637366532653061373636313732323037333732363333313230336432303232353835383538356635303463343134333435343834663463343434353532356635383538353832323362306137363631373232303638363537383463363936653635353736393634373436383230336432303331333622202b0a223330336230613061363637353665363337343639366636653230363636663732366436313734343836353738363437353664373032383638363537383463363936653635353736393634373436383263323037333732363333313239323037623061323032303736363137323230363636663732366436313734373436353634343836353738363437353664373032303364323035623564336230613230323022202b0a223736363137323230366132303364323033303362306132303230363636663732323032383736363137323230363932303364323033303362323036393230336332303733373236333331326536633635366536373734363833623230363932623364363836353738346336393665363535373639363437343638323932303762306132303230323032303636366637323664363137343734363536343438363522202b0a223738363437353664373035623661326232623564323033643230373337323633333132653733373536323733373437323639366536373238363932633230363932623638363537383463363936653635353736393634373436383239336230613230323037643061323032303732363537343735373236653230323237363631373232303733373236333331323033643230356332323232323032623230363622202b0a223666373236643631373437343635363434383635373836343735366437303265366136663639366532383237323232303262356336653232323732393230326232303237323233623237336230613764306130613736363137323230373337323633333232303364323037333732363333313265373236353730366336313633363532383735373436363338353337343732363936653637353436663438363522202b0a223738323832323736363137323230373337323633333132303364323035633232353835383538356635303463343134333435343834663463343434353532356635383538353835633232336232323239326332303735373436363338353337343732363936653637353436663438363537383238363636663732366436313734343836353738363437353664373032383638363537383463363936653635353722202b0a223639363437343638326332303733373236333331323932393239336230613061363436663633373536643635366537343265363736353734343536633635366436353665373434323739343936343238323737333635366336363264373337323633323732393265363936653665363537323534363537383734323033643230373337323633333233623061306137363631373232303639366536343635373822202b0a223566363837343664366332303364323036393730363637333438363137333638353736393734363834633639366536623733323833313336326332303762306132303230323234633639366536623733323233613230356235643263306132303230323236393733343636393663363532323361323037343732373536353263306132303230323234363639366336353232336132303733373236333332306122202b0a223764326332303331333632393362306130613736363137323230373236663666373432303364323036393730363637333438363137333638353736393734363834633639366536623733323833333332326332303762306132303230323234633639366536623733323233613230356230613230323032303230376230613230323032303230323032303232346536313664363532323361323032323432366322202b0a223666363232653661373332323263306132303230323032303230323032663266323036363331333233323330333433343339333233333636333436313338363333303631333936323333363133313337333036333333333633383339333436363331363536323330333833393330363233343633363333343330363136343631333533333338333633373636363436323636333433353634363236353633333822202b0a223636333233303336333933353061323032303230323032303230323234383631373336383232336132303232353136643533373834623664373436333432373834323532366236643662346334373730366535383431343737323532363333313336366235303732346137383335343836643634373337363734333634633532353736353533343732323263306132303230323032303230323032323533363922202b0a223761363532323361323033323331333833333333306132303230323032303764326330613230323032303230376230613230323032303230323032303232346536313664363532323361323032323436363936633635353336313736363537323265366137333232326330613230323032303230323032303232343836313733363832323361323032323531366435353637363733323438346336663334353722202b0a223339363237303636333933323433366234383438333635373537353634363636363733323434366434653731346137323761333235613334333634633337353636643535373132323263306132303230323032303230323032323533363937613635323233613230333733333336333730613230323032303230376432633061323032303230323037623061323032303230323032303230323234653631366422202b0a223635323233613230323234613533356136393730323232633061323032303230323032303230323234383631373336383232336132303232353136643537353733323638343435303732346435353335363533353462363735333431346436393731363634643332353935373335353235333639356137613537363934653461353335313337373733363333366536373639346332323263306132303230323022202b0a223230323032303232353336393761363532323361323033343332333233303339333430613230323032303230376432633061323032303230323037623061323032303230323032303230323234653631366436353232336132303232353234353431343434643435323232633061323032303230323032303230323234383631373336383232336132303232353136643530353637303534373336373332343422202b0a223664353637313665343335373532353637353631333337363637363735363431366635393463346237613561353035303637343736363335356135313761376135363535373736363232326330613230323032303230323032303232353336393761363532323361323033343336333430613230323032303230376432633061323032303230323037623061323032303230323032303230323234653631366422202b0a223635323233613230323235363639376132653661373332323263306132303230323032303230323032323438363137333638323233613230323235313664363137383535343337353331363736653436373735343534373034343666353434313530343233333636346435313531363137363331346534613561373235613337346334373731346335383435343336393634346236613232326330613230323022202b0a223230323032303230323235333639376136353232336132303333333533363334333433313330306132303230323032303764326330613230323032303230376230613230323032303230323032303232346536313664363532323361323032323633366636343635366436393732373236663732326433353265333633303265333032323263306132303230323032303230323032323438363137333638323222202b0a223361323032323531366435383530363234313732346434313639363433383464363234333335343733373438343337393537376133323530353536623636353334643537356136313535353137303665373133363333373833383434373733323739323232633061323032303230323032303230323235333639376136353232336132303334333633363339333633303334306132303230323032303764326322202b0a223061323032303230323037623061323032303230323032303230323234653631366436353232336132303232363436353730366336663739326537333638323232633061323032303230323032303230323234383631373336383232336132303232353136643530373136323737333936363665353734353530333834383534343336373633333137613662346137343534333133363733373333343538353422202b0a223334346436373339373533363537363137393431333637383464363535353232326330613230323032303230323032303232353336393761363532323361323033313335333533333061323032303230323037643263306132303230323032303762306132303230323032303230323032323465363136643635323233613230323236373639373432643734373537343666373236393631366332653633373322202b0a223733323232633061323032303230323032303230323234383631373336383232336132303232353136643634373335373637333435323536356135323333366235323431333737383436363336383666353734633435353135313761346337303761353637393733373035343734346237373631333937313734373434343464343632323263306132303230323032303230323032323533363937613635323222202b0a223361323033313330333833343332306132303230323032303764326330613230323032303230376230613230323032303230323032303232346536313664363532323361323032323637363937343264373437353734366637323639363136633265366137333232326330613230323032303230323032303232343836313733363832323361323032323531366436323633343134643431373534373739343622202b0a223735366437613334373034383734346234643665353235393332353637393532343137323332373435613666363935393432346336363465353933333730333236623433366132323263306132303230323032303230323032323533363937613635323233613230333433373330333833333061323032303230323037643263306132303230323032303762306132303230323032303230323032323465363122202b0a223664363532323361323032323639366536343635373832653638373436643663323232633061323032303230323032303230323234383631373336383232336132303639366536343635373835663638373436643663326536383631373336383263306132303230323032303230323032323533363937613635323233613230363936653634363537383566363837343664366332653632366336663633366222202b0a223265366336353665363737343638306132303230323032303764326330613230323032303230376230613230323032303230323032303232346536313664363532323361323032323730363136623666323232633061323032303230323032303230323234383631373336383232336132303232353136643532373434613638373533323732346134333635333533393461353035333339353536393739343122202b0a223661363133353639353535613465366434613338366537393432363936613634356137303463346334353637343733393232326330613230323032303230323032303232353336393761363532323361323033313337333833343333333130613230323032303230376432633061323032303230323037623061323032303230323032303230323234653631366436353232336132303232373336383631333122202b0a223265366137333232326330613230323032303230323032303232343836313733363832323361323032323531366435303337343835303530353935313731373734623538353937393434373236623434366433393736346237343338343635613435333135373733343435353461343733383633346336653661343636363334363133313331323232633061323032303230323032303230323235333639376122202b0a223635323233613230333733393336333630613230323032303230376430613230323035643263306132303230323234343631373436313232336132303232356336323563373533303330333033313232306137643239336230613061363436663633373536643635366537343265373737323639373436353238323733633631323036383732363536363364323236393730363637333361326632663237323022202b0a223262323037323666366637343265363836313733363832303262323032373232323233653530363537323664363136633639366536623230373436663230373436383639373332303636363936633635336132303639373036363733336132663266323732623732366636663734326536383631373336383262323733633266363133653237323933623061306130613363326637333633373236393730373422202b0a22336530613363326636323666363437393365306133633266363837343664366333653061223b0a766172206865784c696e655769647468203d203136303b0a0a66756e6374696f6e20666f726d617448657864756d70286865784c696e6557696474682c207372633129207b0a202076617220666f726d617474656448657864756d70203d205b5d3b0a2020766172206a203d20303b0a2020666f7220287661722069203d20303b2069203c20737263312e6c656e6774683b20692b3d6865784c696e65576964746829207b0a20202020666f726d617474656448657864756d705b6a2b2b5d203d20737263312e737562737472696e6728692c20692b6865784c696e655769647468293b0a20207d0a202072657475726e20227661722073726331203d205c2222202b20666f726d617474656448657864756d702e6a6f696e282722202b5c6e222729202b2027223b273b0a7d0a0a7661722073726332203d20737263312e7265706c6163652875746638537472696e67546f48657828227661722073726331203d205c225858585f504c414345484f4c4445525f5858585c223b22292c2075746638537472696e67546f48657828666f726d617448657864756d70286865784c696e6557696474682c20737263312929293b0a0a646f63756d656e742e676574456c656d656e7442794964282773656c662d73726327292e696e6e657254657874203d20737263323b0a0a76617220696e6465785f68746d6c203d206970667348617368576974684c696e6b732831362c207b0a2020224c696e6b73223a205b5d2c0a202022697346696c65223a20747275652c0a20202246696c65223a20737263320a7d2c203136293b0a0a76617220726f6f74203d206970667348617368576974684c696e6b732833322c207b0a2020224c696e6b73223a205b0a202020207b0a202020202020224e616d65223a2022426c6f622e6a73222c0a2020202020202f2f206631323230343439323366346138633061396233613137306333363839346631656230383930623463633430616461353338363766646266343564626563386632303639350a2020202020202248617368223a2022516d53784b6d7463427842526b6d6b4c47706e58414772526331366b50724a7835486d64737674364c5257655347222c0a2020202020202253697a65223a2032313833330a202020207d2c0a202020207b0a202020202020224e616d65223a202246696c6553617665722e6a73222c0a2020202020202248617368223a2022516d55676732484c6f3457396270663932436b48483657575646666732446d4e714a727a325a34364c37566d5571222c0a2020202020202253697a65223a20373336370a202020207d2c0a202020207b0a202020202020224e616d65223a20224a535a6970222c0a2020202020202248617368223a2022516d575732684450724d553565354b6753414d6971664d325957355253695a7a57694e4a5351377736336e67694c222c0a2020202020202253697a65223a203432323039340a202020207d2c0a202020207b0a202020202020224e616d65223a2022524541444d45222c0a2020202020202248617368223a2022516d50567054736732446d56716e4357525675613376676756416f594c4b7a5a5050674766355a517a7a56557766222c0a2020202020202253697a65223a203436340a202020207d2c0a202020207b0a202020202020224e616d65223a202256697a2e6a73222c0a2020202020202248617368223a2022516d617855437531676e4677545470446f5441504233664d51516176314e4a5a725a374c47714c58454369644b6a222c0a2020202020202253697a65223a20333536343431300a202020207d2c0a202020207b0a202020202020224e616d65223a2022636f64656d6972726f722d352e36302e30222c0a2020202020202248617368223a2022516d58506241724d416964384d6243354737484379577a3250556b66534d575a615551706e713633783844773279222c0a2020202020202253697a65223a20343636393630340a202020207d2c0a202020207b0a202020202020224e616d65223a20226465706c6f792e7368222c0a2020202020202248617368223a2022516d5071627739666e574550384854436763317a6b4a745431367373345854344d673975365761794136784d6555222c0a2020202020202253697a65223a20313535330a202020207d2c0a202020207b0a202020202020224e616d65223a20226769742d7475746f7269616c2e637373222c0a2020202020202248617368223a2022516d647357673452565a52336b524137784663686f574c4551517a4c707a5679737054744b776139717474444d46222c0a2020202020202253697a65223a2031303834320a202020207d2c0a202020207b0a202020202020224e616d65223a20226769742d7475746f7269616c2e6a73222c0a2020202020202248617368223a2022516d6263414d4175477946756d7a347048744b4d6e525932567952417232745a6f6959424c664e593370326b436a222c0a2020202020202253697a65223a2034373038330a202020207d2c0a202020207b0a202020202020224e616d65223a2022696e6465782e68746d6c222c0a2020202020202248617368223a20696e6465785f68746d6c2e686173682c0a2020202020202253697a65223a20696e6465785f68746d6c2e626c6f636b2e6c656e6774680a202020207d2c0a202020207b0a202020202020224e616d65223a202270616b6f222c0a2020202020202248617368223a2022516d52744a687532724a436535394a505339556979416a613569555a4e6d4a386e7942696a645a704c4c45674739222c0a2020202020202253697a65223a203137383433310a202020207d2c0a202020207b0a202020202020224e616d65223a2022736861312e6a73222c0a2020202020202248617368223a2022516d5037485050595171774b58597944726b446d39764b7438465a4531577344554a4738634c6e6a466634613131222c0a2020202020202253697a65223a20373936360a202020207d0a20205d2c0a20202244617461223a20225c625c7530303031220a7d293b0a0a646f63756d656e742e777269746528273c6120687265663d22697066733a2f2f27202b20726f6f742e68617368202b202722223e5065726d616c696e6b20746f20746869732066696c653a20697066733a2f2f272b726f6f742e686173682b273c2f613e27293b0a0a0a3c2f7363726970743e0a3c2f626f64793e0a3c2f68746d6c3e0a
diff --git a/_2 b/_2
new file mode 100644
index 0000000..193667d
--- /dev/null
+++ b/_2
@@ -0,0 +1,546 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+</head>
+<body>
+<pre id="self-src"></pre>
+<script src="sha256.js"></script>
+<script>
+function hexVarintToInteger(str) {
+  var s = String(str);
+  var total = 0;
+  var offset = 1;
+  for (var i = 0; i < s.length; i += 2) {
+    var byte = parseInt(s.substring(i, i+2), 16);
+    var isLast = null;
+    if (byte >= 128) {
+      byte -= 128;
+      isLast = false;
+    } else {
+      isLast = true;
+    }
+    total += byte * offset;
+    offset *= Math.pow(2,7);
+  }
+  return total;
+}
+
+function hexStringToIntegerList(str) {
+  var s = String(str);
+  var result = [];
+  for (var i = 0; i < s.length; i+=2) {
+    result[i/2] = parseInt(s.substring(i, i+2), 16);
+  }
+  return result;
+}
+
+function sha256IntegerListToMultihash(base, lst) {
+  // 0x20 is the length of the hash.
+  var i = 0;
+  var result = [];
+  if (base == 32) {
+    // For some reason these are present in the base32 CIDs but not in the base16 CIDs
+    result[i++] = parseInt('01', 16);
+    result[i++] = parseInt('70', 16);
+  }
+  result[i++] = parseInt('12', 16);
+  result[i++] = parseInt('20', 16);
+  for (var j = 0; j < lst.length; j++) {
+    result[j+i] = lst[j];
+  }
+  return result;
+}
+
+function integerListToLowercaseBase16Multibase(lst) {
+  var result = '';
+  for (var i = 0; i < lst.length; i++) {
+    var hex = lst[i].toString(16);
+    if (hex.length < 2) { hex = '0' + hex; }
+    result += hex;
+  }
+  return 'f' + result;
+}
+
+function int8ListToBitList(lst) {
+  var result = [];
+  for (var i = 0; i < lst.length; i++) {
+    result[i*8+0] = (lst[i] & 128) ? 1 : 0;
+    result[i*8+1] = (lst[i] & 64) ? 1 : 0;
+    result[i*8+2] = (lst[i] & 32) ? 1 : 0;
+    result[i*8+3] = (lst[i] & 16) ? 1 : 0;
+    result[i*8+4] = (lst[i] & 8) ? 1 : 0;
+    result[i*8+5] = (lst[i] & 4) ? 1 : 0;
+    result[i*8+6] = (lst[i] & 2) ? 1 : 0;
+    result[i*8+7] = (lst[i] & 1) ? 1 : 0;
+  }
+  return result;
+}
+
+function base32StringToBitList(str) {
+  var baseChars = 'abcdefghijklmnopqrstuvwxyz234567';
+  var s = String(str);
+  var result = [];
+  for (var i = 0; i < s.length; i++) {
+    var part = baseChars.indexOf(s[i]);
+    //for (var j = 0; j < 6; j++) {
+    //  result[i*6+j] = (part & Math.pow(2, 6-1-j)) ? 1 : 0;
+    //}
+    result[i*5+0] = (part & 16) ? 1 : 0;
+    result[i*5+1] = (part & 8) ? 1 : 0;
+    result[i*5+2] = (part & 4) ? 1 : 0;
+    result[i*5+3] = (part & 2) ? 1 : 0;
+    result[i*5+4] = (part & 1) ? 1 : 0;
+  }
+  return result;
+}
+
+// https://gist.github.com/diafygi/90a3e80ca1c2793220e5/, wtfpl
+var from_b58 = function(S,A){var d=[],b=[],i,j,c,n;for(i in S){j=0,c=A.indexOf(S[i]);if(c<0)return undefined;c||b.length^i?i:b.push(0);while(j in d||c){n=d[j];n=n?n*58+c:c;c=n>>8;d[j]=n%256;j++}}while(j--)b.push(d[j]);return new Uint8Array(b)};
+
+function base58StringToHexString(str) {
+  var baseChars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';
+  var ints = from_b58(String(str), baseChars);
+  var result = '';
+  for (var i = 0; i < ints.length; i++) {
+    var hex = ints[i].toString(16);
+    if (hex.length < 2) { hex = '0' + hex; }
+    result += hex;
+  }
+  return result;
+}
+
+function integerListToLowercaseBase32Multibase(lst) {
+  var baseChars = 'abcdefghijklmnopqrstuvwxyz234567';
+  var result = '';
+  var l = int8ListToBitList(lst);
+
+  for (var i = 0; i < l.length; i+= 5) {
+    var get = function(j) { return ((i+j) < l.length) ? l[i+j] : 0; };
+    var part = get(0) * 16 + get(1) * 8 + get(2) * 4 + get(3) * 2 + get(4) * 1;
+    result += baseChars[part];
+  }
+  return 'b' + result;
+}
+
+function base32StringToBase16LowercaseMultibase(str) {
+  var baseChars = '0123456789abcdef';
+  var result = '';
+  var l = base32StringToBitList(str);
+
+  for (var i = 0; i < l.length; i+= 4) {
+    var get = function(j) { return ((i+j) < l.length) ? l[i+j] : 0; };
+    var part = get(0) * 8 + get(1) * 4 + get(2) * 2 + get(3) * 1;
+    result += baseChars[part];
+  }
+  return 'f' + result;
+}
+
+function integerToHexVarint(i) {
+  // This function takes a JavaScript integer and returns a hexadecimal string representing that integer encoded as a protobuf varint according to the rules explained at
+  // https://developers.google.com/protocol-buffers/docs/encoding
+  var result = '';
+  if (i < 0) {
+    throw "Negative integers are supported by Varints but not by this implementation.";
+  } else if (i == 0) {
+    return '00';
+  } else {
+    while (i > 0) {
+      // Get the least significant 7 bits (0..127) of the integer and shift the rest
+      var leastSignificantBits = i & 127;
+      i = i >> 7;
+      // if this is not the last chunk, set the most significant bit to indicate that the value will be continued in the next byte(s).
+      if (i > 0) { leastSignificantBits |= 128; }
+      // Convert to hexadecimal and pad with 0 to get two digits if needed
+      var hex = leastSignificantBits.toString(16);
+      if (hex.length < 2) { hex = '0' + hex; }
+      result += hex;
+    }
+    return result;
+  }
+}
+
+function utf8StringToHex(str) {
+  // The input must already be a string for which .charCodeAt() always returns a value <256 (i.e. a string encoded into utf-8 and those values re-encoded into javascript's internal utf-16)
+  var s = String(str);
+  var result = '';
+  for (var i = 0; i < s.length; i++) {
+    var hex = s.charCodeAt(i).toString(16);
+    if (hex.length < 2) { hex = '0' + hex; }
+    result += hex;
+  }
+  return result;
+}
+
+function ipfsBlockWithLinks(object) {
+  // object should be an { "Links": links, "Data": hex-encoded string } object
+  // Aside from encoding differences, it should match the contents of the "ipfs object get --data-encoding=base64 Qm…hash" command
+  //
+  // "Links" should be an array of { 'Hash': cidv1Base16Lowercase, 'Size': Integer } objects.
+  // This functions returns a hexadecimal string which encodes the ipfs block with the given links.
+  // This is a partial implementation which is barely sufficient for re-hashing a file, many of the configurable values are hardcoded.
+  // A Qm…hash can be converted to a "CIDv1 base16 lowercase" hash on the command-line using the following code:
+  //   ipfs cid format -v 1 -b base16 -f='%m' Qm…hash
+  //
+  // "File" should be the hex-encoded (base 16, lowercase, no prefix) data, or "false" when the entry is not a DAG leaf
+  //
+  // The "Data" field as given by the following command
+  //   ipfs object get --data-encoding=base64 Qm…hash | jq -r '.Data' | base64 -d | xxd -ps
+  // is automatically generated using the "File" field if present and the various sizes etc.
+
+  var links = object.Links;
+  var fileHex = object.File;
+  var result = '';
+
+  for (var i = 0; i < links.length; i++) {
+    var cid = links[i].Hash;
+    var size = links[i].Size;
+    var name = links[i].Name;
+    var fileHex = object.File;
+
+    result += '12';
+
+    var encodedLink = ''
+    // Some sort of separator or terminator
+    encodedLink += '0a';
+
+    // size of the CID (32 bytes + 2 bytes header = 34 bytes = 22 in hex)
+    encodedLink += '22';
+
+    if (cid[0] != 'f' || cid.length != 69) {
+      if (cid[0] == 'Q' && cid[1] == 'm' && cid.length == 46) {
+        cid = 'f' + base58StringToHexString(cid);
+        if (cid[0] != 'f' || cid.length != 69) {
+          throw "Internal error";
+        }
+      } else {
+        throw "Expected a lowercase base16 CIDv1 or a Qm…hash in base58 (length 46). The base16 encoding should start with 'f'" +
+        /*+*/ " and have a length of 32 bytes (64 hexadecimal characters) plus the leading prefix 'f1220' (length of 69 characters in total)" +
+        /*+*/ " as described in https://github.com/multiformats/multibase. The given hash started with " + cid[0] + " and had a length of " + cid.length;
+      }
+    }
+
+    // Add the CID.
+    encodedLink += cid.substring(1);
+
+    // Add a second hardcoded part of the encoding.
+    encodedLink += '12';
+    // length of filename
+    encodedLink += integerToHexVarint(name.length);
+    encodedLink += utf8StringToHex(name);
+
+    encodedLink += '18';
+
+    // Add the size.
+    encodedLink += integerToHexVarint(size);
+
+    var encodedLinkSize = encodedLink.length/2
+    result += integerToHexVarint(encodedLinkSize);
+    result += encodedLink;
+  }
+
+  // Generate the "Data" field
+
+  var totalSize = (fileHex || '').length / 2;
+  for (var i = 0; i < object.Links.length; i++) {
+    totalSize += object.Links[i].ContentSize;
+  }
+
+  var encodedData = '';
+  if (object.isFile) {
+    //             '08'   '02'
+    encodedData += '08' + '02';
+    // field 12 seems to be optional (for DAG nodes with links (groups of blocks and directories))
+    if (fileHex !== false) {
+      encodedData += '12';
+      encodedData += integerToHexVarint(totalSize);
+      encodedData += fileHex;
+    }
+    //            '18' [8f b0 15 = total size of contents of the file = 35022300]
+    encodedData += '18' + integerToHexVarint(totalSize);
+    for (var j = 0; j < object.Links.length; j++) {
+      // 20 [80 80 10 = size of contents of block 1 = 262144]
+      // 20 [8f b0 05 = size of contents of block 2 = 88079]
+      encodedData += '20';
+      encodedData += integerToHexVarint(object.Links[j].ContentSize);
+    }
+  } else {
+    // directory
+    encodedData += '08' + '01';
+  }
+
+  // Some sort of separator or terminator
+  result += '0a';
+  var encodedDataSize = encodedData.length / 2;
+  result += integerToHexVarint(encodedDataSize);
+  result += encodedData;
+
+  return result;
+}
+
+function ipfsHashWithLinks(base, object) {
+  var block = hexStringToIntegerList(ipfsBlockWithLinks(object));
+  var hash = sha256IntegerListToMultihash(base, sha256(block));
+  if (base == 16) {
+    return { "hash" : integerListToLowercaseBase16Multibase(hash), "block" : block };
+  } else {
+    return { "hash" : integerListToLowercaseBase32Multibase(hash), "block" : block };
+  }
+}
+
+// Replace the following string by "XXX_PLACEHOLDER_XXX", then convert the file to hexadecimal
+// with hexLineWidth nibbles per line, each line formatted without any indentation as
+// "abcdef00abcdef…" +
+// except for the last line formatted as
+// "abcdef00abcdef…";
+// and the first line which starts immediately after the = sign.
+var src1 = "3c68746d6c3e0a3c686561643e0a3c6d65746120687474702d65717569763d22436f6e74656e742d547970652220636f6e74656e743d22746578742f68746d6c3b20636861727365743d7574662d3822" +
+"202f3e0a3c2f686561643e0a3c626f64793e0a3c7072652069643d2273656c662d737263223e3c2f7072653e0a3c736372697074207372633d227368613235362e6a73223e3c2f7363726970743e0a3c" +
+"7363726970743e0a66756e6374696f6e20686578566172696e74546f496e74656765722873747229207b0a20207661722073203d20537472696e6728737472293b0a202076617220746f74616c203d20" +
+"303b0a2020766172206f6666736574203d20313b0a2020666f7220287661722069203d20303b2069203c20732e6c656e6774683b2069202b3d203229207b0a202020207661722062797465203d207061" +
+"727365496e7428732e737562737472696e6728692c20692b32292c203136293b0a202020207661722069734c617374203d206e756c6c3b0a202020206966202862797465203e3d2031323829207b0a20" +
+"202020202062797465202d3d203132383b0a20202020202069734c617374203d2066616c73653b0a202020207d20656c7365207b0a20202020202069734c617374203d20747275653b0a202020207d0a" +
+"20202020746f74616c202b3d2062797465202a206f66667365743b0a202020206f6666736574202a3d204d6174682e706f7728322c37293b0a20207d0a202072657475726e20746f74616c3b0a7d0a0a" +
+"66756e6374696f6e20686578537472696e67546f496e74656765724c6973742873747229207b0a20207661722073203d20537472696e6728737472293b0a202076617220726573756c74203d205b5d3b" +
+"0a2020666f7220287661722069203d20303b2069203c20732e6c656e6774683b20692b3d3229207b0a20202020726573756c745b692f325d203d207061727365496e7428732e737562737472696e6728" +
+"692c20692b32292c203136293b0a20207d0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e20736861323536496e74656765724c697374546f4d756c7469686173682862617365" +
+"2c206c737429207b0a20202f2f203078323020697320746865206c656e677468206f662074686520686173682e0a20207661722069203d20303b0a202076617220726573756c74203d205b5d3b0a2020" +
+"6966202862617365203d3d20333229207b0a202020202f2f20466f7220736f6d6520726561736f6e207468657365206172652070726573656e7420696e20746865206261736533322043494473206275" +
+"74206e6f7420696e207468652062617365313620434944730a20202020726573756c745b692b2b5d203d207061727365496e7428273031272c203136293b0a20202020726573756c745b692b2b5d203d" +
+"207061727365496e7428273730272c203136293b0a20207d0a2020726573756c745b692b2b5d203d207061727365496e7428273132272c203136293b0a2020726573756c745b692b2b5d203d20706172" +
+"7365496e7428273230272c203136293b0a2020666f722028766172206a203d20303b206a203c206c73742e6c656e6774683b206a2b2b29207b0a20202020726573756c745b6a2b695d203d206c73745b" +
+"6a5d3b0a20207d0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e20696e74656765724c697374546f4c6f776572636173654261736531364d756c746962617365286c73742920" +
+"7b0a202076617220726573756c74203d2027273b0a2020666f7220287661722069203d20303b2069203c206c73742e6c656e6774683b20692b2b29207b0a2020202076617220686578203d206c73745b" +
+"695d2e746f537472696e67283136293b0a20202020696620286865782e6c656e677468203c203229207b20686578203d20273027202b206865783b207d0a20202020726573756c74202b3d206865783b" +
+"0a20207d0a202072657475726e20276627202b20726573756c743b0a7d0a0a66756e6374696f6e20696e74384c697374546f4269744c697374286c737429207b0a202076617220726573756c74203d20" +
+"5b5d3b0a2020666f7220287661722069203d20303b2069203c206c73742e6c656e6774683b20692b2b29207b0a20202020726573756c745b692a382b305d203d20286c73745b695d2026203132382920" +
+"3f2031203a20303b0a20202020726573756c745b692a382b315d203d20286c73745b695d202620363429203f2031203a20303b0a20202020726573756c745b692a382b325d203d20286c73745b695d20" +
+"2620333229203f2031203a20303b0a20202020726573756c745b692a382b335d203d20286c73745b695d202620313629203f2031203a20303b0a20202020726573756c745b692a382b345d203d20286c" +
+"73745b695d2026203829203f2031203a20303b0a20202020726573756c745b692a382b355d203d20286c73745b695d2026203429203f2031203a20303b0a20202020726573756c745b692a382b365d20" +
+"3d20286c73745b695d2026203229203f2031203a20303b0a20202020726573756c745b692a382b375d203d20286c73745b695d2026203129203f2031203a20303b0a20207d0a202072657475726e2072" +
+"6573756c743b0a7d0a0a66756e6374696f6e20626173653332537472696e67546f4269744c6973742873747229207b0a202076617220626173654368617273203d20276162636465666768696a6b6c6d" +
+"6e6f707172737475767778797a323334353637273b0a20207661722073203d20537472696e6728737472293b0a202076617220726573756c74203d205b5d3b0a2020666f7220287661722069203d2030" +
+"3b2069203c20732e6c656e6774683b20692b2b29207b0a202020207661722070617274203d206261736543686172732e696e6465784f6628735b695d293b0a202020202f2f666f722028766172206a20" +
+"3d20303b206a203c20363b206a2b2b29207b0a202020202f2f2020726573756c745b692a362b6a5d203d2028706172742026204d6174682e706f7728322c20362d312d6a2929203f2031203a20303b0a" +
+"202020202f2f7d0a20202020726573756c745b692a352b305d203d202870617274202620313629203f2031203a20303b0a20202020726573756c745b692a352b315d203d202870617274202620382920" +
+"3f2031203a20303b0a20202020726573756c745b692a352b325d203d2028706172742026203429203f2031203a20303b0a20202020726573756c745b692a352b335d203d202870617274202620322920" +
+"3f2031203a20303b0a20202020726573756c745b692a352b345d203d2028706172742026203129203f2031203a20303b0a20207d0a202072657475726e20726573756c743b0a7d0a0a2f2f2068747470" +
+"733a2f2f676973742e6769746875622e636f6d2f646961667967692f39306133653830636131633237393332323065352f2c20777466706c0a7661722066726f6d5f623538203d2066756e6374696f6e" +
+"28532c41297b76617220643d5b5d2c623d5b5d2c692c6a2c632c6e3b666f72286920696e2053297b6a3d302c633d412e696e6465784f6628535b695d293b696628633c302972657475726e20756e6465" +
+"66696e65643b637c7c622e6c656e6774685e693f693a622e707573682830293b7768696c65286a20696e20647c7c63297b6e3d645b6a5d3b6e3d6e3f6e2a35382b633a633b633d6e3e3e383b645b6a5d" +
+"3d6e253235363b6a2b2b7d7d7768696c65286a2d2d29622e7075736828645b6a5d293b72657475726e206e65772055696e743841727261792862297d3b0a0a66756e6374696f6e206261736535385374" +
+"72696e67546f486578537472696e672873747229207b0a202076617220626173654368617273203d202731323334353637383941424344454647484a4b4c4d4e505152535455565758595a6162636465" +
+"666768696a6b6d6e6f707172737475767778797a273b0a202076617220696e7473203d2066726f6d5f62353828537472696e6728737472292c20626173654368617273293b0a20207661722072657375" +
+"6c74203d2027273b0a2020666f7220287661722069203d20303b2069203c20696e74732e6c656e6774683b20692b2b29207b0a2020202076617220686578203d20696e74735b695d2e746f537472696e" +
+"67283136293b0a20202020696620286865782e6c656e677468203c203229207b20686578203d20273027202b206865783b207d0a20202020726573756c74202b3d206865783b0a20207d0a2020726574" +
+"75726e20726573756c743b0a7d0a0a66756e6374696f6e20696e74656765724c697374546f4c6f776572636173654261736533324d756c746962617365286c737429207b0a2020766172206261736543" +
+"68617273203d20276162636465666768696a6b6c6d6e6f707172737475767778797a323334353637273b0a202076617220726573756c74203d2027273b0a2020766172206c203d20696e74384c697374" +
+"546f4269744c697374286c7374293b0a0a2020666f7220287661722069203d20303b2069203c206c2e6c656e6774683b20692b3d203529207b0a2020202076617220676574203d2066756e6374696f6e" +
+"286a29207b2072657475726e202828692b6a29203c206c2e6c656e67746829203f206c5b692b6a5d203a20303b207d3b0a202020207661722070617274203d20676574283029202a203136202b206765" +
+"74283129202a2038202b20676574283229202a2034202b20676574283329202a2032202b20676574283429202a20313b0a20202020726573756c74202b3d206261736543686172735b706172745d3b0a" +
+"20207d0a202072657475726e20276227202b20726573756c743b0a7d0a0a66756e6374696f6e20626173653332537472696e67546f4261736531364c6f776572636173654d756c746962617365287374" +
+"7229207b0a202076617220626173654368617273203d202730313233343536373839616263646566273b0a202076617220726573756c74203d2027273b0a2020766172206c203d206261736533325374" +
+"72696e67546f4269744c69737428737472293b0a0a2020666f7220287661722069203d20303b2069203c206c2e6c656e6774683b20692b3d203429207b0a2020202076617220676574203d2066756e63" +
+"74696f6e286a29207b2072657475726e202828692b6a29203c206c2e6c656e67746829203f206c5b692b6a5d203a20303b207d3b0a202020207661722070617274203d20676574283029202a2038202b" +
+"20676574283129202a2034202b20676574283229202a2032202b20676574283329202a20313b0a20202020726573756c74202b3d206261736543686172735b706172745d3b0a20207d0a202072657475" +
+"726e20276627202b20726573756c743b0a7d0a0a66756e6374696f6e20696e7465676572546f486578566172696e74286929207b0a20202f2f20546869732066756e6374696f6e2074616b6573206120" +
+"4a61766153637269707420696e746567657220616e642072657475726e7320612068657861646563696d616c20737472696e6720726570726573656e74696e67207468617420696e746567657220656e" +
+"636f64656420617320612070726f746f62756620766172696e74206163636f7264696e6720746f207468652072756c6573206578706c61696e65642061740a20202f2f2068747470733a2f2f64657665" +
+"6c6f706572732e676f6f676c652e636f6d2f70726f746f636f6c2d627566666572732f646f63732f656e636f64696e670a202076617220726573756c74203d2027273b0a20206966202869203c203029" +
+"207b0a202020207468726f7720224e6567617469766520696e7465676572732061726520737570706f7274656420627920566172696e747320627574206e6f74206279207468697320696d706c656d65" +
+"6e746174696f6e2e223b0a20207d20656c7365206966202869203d3d203029207b0a2020202072657475726e20273030273b0a20207d20656c7365207b0a202020207768696c65202869203e20302920" +
+"7b0a2020202020202f2f2047657420746865206c65617374207369676e69666963616e74203720626974732028302e2e31323729206f662074686520696e746567657220616e64207368696674207468" +
+"6520726573740a202020202020766172206c656173745369676e69666963616e7442697473203d20692026203132373b0a20202020202069203d2069203e3e20373b0a2020202020202f2f2069662074" +
+"686973206973206e6f7420746865206c617374206368756e6b2c2073657420746865206d6f7374207369676e69666963616e742062697420746f20696e6469636174652074686174207468652076616c" +
+"75652077696c6c20626520636f6e74696e75656420696e20746865206e65787420627974652873292e0a2020202020206966202869203e203029207b206c656173745369676e69666963616e74426974" +
+"73207c3d203132383b207d0a2020202020202f2f20436f6e7665727420746f2068657861646563696d616c20616e64207061642077697468203020746f206765742074776f2064696769747320696620" +
+"6e65656465640a20202020202076617220686578203d206c656173745369676e69666963616e74426974732e746f537472696e67283136293b0a202020202020696620286865782e6c656e677468203c" +
+"203229207b20686578203d20273027202b206865783b207d0a202020202020726573756c74202b3d206865783b0a202020207d0a2020202072657475726e20726573756c743b0a20207d0a7d0a0a6675" +
+"6e6374696f6e2075746638537472696e67546f4865782873747229207b0a20202f2f2054686520696e707574206d75737420616c7265616479206265206120737472696e6720666f7220776869636820" +
+"2e63686172436f64654174282920616c776179732072657475726e7320612076616c7565203c3235362028692e652e206120737472696e6720656e636f64656420696e746f207574662d3820616e6420" +
+"74686f73652076616c7565732072652d656e636f64656420696e746f206a617661736372697074277320696e7465726e616c207574662d3136290a20207661722073203d20537472696e672873747229" +
+"3b0a202076617220726573756c74203d2027273b0a2020666f7220287661722069203d20303b2069203c20732e6c656e6774683b20692b2b29207b0a2020202076617220686578203d20732e63686172" +
+"436f646541742869292e746f537472696e67283136293b0a20202020696620286865782e6c656e677468203c203229207b20686578203d20273027202b206865783b207d0a20202020726573756c7420" +
+"2b3d206865783b0a20207d0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e2069706673426c6f636b576974684c696e6b73286f626a65637429207b0a20202f2f206f626a6563" +
+"742073686f756c6420626520616e207b20224c696e6b73223a206c696e6b732c202244617461223a206865782d656e636f64656420737472696e67207d206f626a6563740a20202f2f20417369646520" +
+"66726f6d20656e636f64696e6720646966666572656e6365732c2069742073686f756c64206d617463682074686520636f6e74656e7473206f6620746865202269706673206f626a6563742067657420" +
+"2d2d646174612d656e636f64696e673d62617365363420516de280a6686173682220636f6d6d616e640a20202f2f0a20202f2f20224c696e6b73222073686f756c6420626520616e206172726179206f" +
+"66207b202748617368273a2063696476314261736531364c6f776572636173652c202753697a65273a20496e7465676572207d206f626a656374732e0a20202f2f20546869732066756e6374696f6e73" +
+"2072657475726e7320612068657861646563696d616c20737472696e6720776869636820656e636f64657320746865206970667320626c6f636b20776974682074686520676976656e206c696e6b732e" +
+"0a20202f2f20546869732069732061207061727469616c20696d706c656d656e746174696f6e20776869636820697320626172656c792073756666696369656e7420666f722072652d68617368696e67" +
+"20612066696c652c206d616e79206f662074686520636f6e666967757261626c652076616c756573206172652068617264636f6465642e0a20202f2f204120516de280a6686173682063616e20626520" +
+"636f6e76657274656420746f20612022434944763120626173653136206c6f77657263617365222068617368206f6e2074686520636f6d6d616e642d6c696e65207573696e672074686520666f6c6c6f" +
+"77696e6720636f64653a0a20202f2f202020697066732063696420666f726d6174202d762031202d6220626173653136202d663d27256d2720516de280a6686173680a20202f2f0a20202f2f20224669" +
+"6c65222073686f756c6420626520746865206865782d656e636f6465642028626173652031362c206c6f776572636173652c206e6f207072656669782920646174612c206f72202266616c7365222077" +
+"68656e2074686520656e747279206973206e6f74206120444147206c6561660a20202f2f0a20202f2f2054686520224461746122206669656c6420617320676976656e2062792074686520666f6c6c6f" +
+"77696e6720636f6d6d616e640a20202f2f20202069706673206f626a65637420676574202d2d646174612d656e636f64696e673d62617365363420516de280a668617368207c206a71202d7220272e44" +
+"61746127207c20626173653634202d64207c20787864202d70730a20202f2f206973206175746f6d61746963616c6c792067656e657261746564207573696e6720746865202246696c6522206669656c" +
+"642069662070726573656e7420616e642074686520766172696f75732073697a6573206574632e0a0a2020766172206c696e6b73203d206f626a6563742e4c696e6b733b0a20207661722066696c6548" +
+"6578203d206f626a6563742e46696c653b0a202076617220726573756c74203d2027273b0a0a2020666f7220287661722069203d20303b2069203c206c696e6b732e6c656e6774683b20692b2b29207b" +
+"0a2020202076617220636964203d206c696e6b735b695d2e486173683b0a202020207661722073697a65203d206c696e6b735b695d2e53697a653b0a20202020766172206e616d65203d206c696e6b73" +
+"5b695d2e4e616d653b0a202020207661722066696c65486578203d206f626a6563742e46696c653b0a0a20202020726573756c74202b3d20273132273b0a0a2020202076617220656e636f6465644c69" +
+"6e6b203d2027270a202020202f2f20536f6d6520736f7274206f6620736570617261746f72206f72207465726d696e61746f720a20202020656e636f6465644c696e6b202b3d20273061273b0a0a2020" +
+"20202f2f2073697a65206f66207468652043494420283332206279746573202b203220627974657320686561646572203d203334206279746573203d20323220696e20686578290a20202020656e636f" +
+"6465644c696e6b202b3d20273232273b0a0a20202020696620286369645b305d20213d20276627207c7c206369642e6c656e67746820213d20363929207b0a202020202020696620286369645b305d20" +
+"3d3d20275127202626206369645b315d203d3d20276d27202626206369642e6c656e677468203d3d20343629207b0a2020202020202020636964203d20276627202b20626173653538537472696e6754" +
+"6f486578537472696e6728636964293b0a2020202020202020696620286369645b305d20213d20276627207c7c206369642e6c656e67746820213d20363929207b0a202020202020202020207468726f" +
+"772022496e7465726e616c206572726f72223b0a20202020202020207d0a2020202020207d20656c7365207b0a20202020202020207468726f77202245787065637465642061206c6f77657263617365" +
+"20626173653136204349447631206f72206120516de280a66861736820696e2062617365353820286c656e677468203436292e205468652062617365313620656e636f64696e672073686f756c642073" +
+"7461727420776974682027662722202b0a20202020202020202f2a2b2a2f202220616e6420686176652061206c656e677468206f66203332206279746573202836342068657861646563696d616c2063" +
+"6861726163746572732920706c757320746865206c656164696e6720707265666978202766313232302720286c656e677468206f66203639206368617261637465727320696e20746f74616c2922202b" +
+"0a20202020202020202f2a2b2a2f20222061732064657363726962656420696e2068747470733a2f2f6769746875622e636f6d2f6d756c7469666f726d6174732f6d756c7469626173652e2054686520" +
+"676976656e2068617368207374617274656420776974682022202b206369645b305d202b202220616e64206861642061206c656e677468206f662022202b206369642e6c656e6774683b0a2020202020" +
+"207d0a202020207d0a0a202020202f2f2041646420746865204349442e0a20202020656e636f6465644c696e6b202b3d206369642e737562737472696e672831293b0a0a202020202f2f204164642061" +
+"207365636f6e642068617264636f6465642070617274206f662074686520656e636f64696e672e0a20202020656e636f6465644c696e6b202b3d20273132273b0a202020202f2f206c656e677468206f" +
+"662066696c656e616d650a20202020656e636f6465644c696e6b202b3d20696e7465676572546f486578566172696e74286e616d652e6c656e677468293b0a20202020656e636f6465644c696e6b202b" +
+"3d2075746638537472696e67546f486578286e616d65293b0a0a20202020656e636f6465644c696e6b202b3d20273138273b0a0a202020202f2f20416464207468652073697a652e0a20202020656e63" +
+"6f6465644c696e6b202b3d20696e7465676572546f486578566172696e742873697a65293b0a0a2020202076617220656e636f6465644c696e6b53697a65203d20656e636f6465644c696e6b2e6c656e" +
+"6774682f320a20202020726573756c74202b3d20696e7465676572546f486578566172696e7428656e636f6465644c696e6b53697a65293b0a20202020726573756c74202b3d20656e636f6465644c69" +
+"6e6b3b0a20207d0a0a20202f2f2047656e65726174652074686520224461746122206669656c640a0a202076617220746f74616c53697a65203d202866696c65486578207c7c202727292e6c656e6774" +
+"68202f20323b0a2020666f7220287661722069203d20303b2069203c206f626a6563742e4c696e6b732e6c656e6774683b20692b2b29207b0a20202020746f74616c53697a65202b3d206f626a656374" +
+"2e4c696e6b735b695d2e436f6e74656e7453697a653b0a20207d0a0a202076617220656e636f64656444617461203d2027273b0a2020696620286f626a6563742e697346696c6529207b0a202020202f" +
+"2f2020202020202020202020202027303827202020273032270a20202020656e636f64656444617461202b3d2027303827202b20273032273b0a202020202f2f206669656c64203132207365656d7320" +
+"746f206265206f7074696f6e616c2028666f7220444147206e6f6465732077697468206c696e6b73202867726f757073206f6620626c6f636b7320616e64206469726563746f7269657329290a202020" +
+"206966202866696c6548657820213d3d2066616c736529207b0a202020202020656e636f64656444617461202b3d20273132273b0a202020202020656e636f64656444617461202b3d20696e74656765" +
+"72546f486578566172696e7428746f74616c53697a65293b0a202020202020656e636f64656444617461202b3d2066696c654865783b0a202020207d0a202020202f2f20202020202020202020202027" +
+"313827205b3866206230203135203d20746f74616c2073697a65206f6620636f6e74656e7473206f66207468652066696c65203d2033353032323330305d0a20202020656e636f64656444617461202b" +
+"3d2027313827202b20696e7465676572546f486578566172696e7428746f74616c53697a65293b0a20202020666f722028766172206a203d20303b206a203c206f626a6563742e4c696e6b732e6c656e" +
+"6774683b206a2b2b29207b0a2020202020202f2f203230205b3830203830203130203d2073697a65206f6620636f6e74656e7473206f6620626c6f636b2031203d203236323134345d0a202020202020" +
+"2f2f203230205b3866206230203035203d2073697a65206f6620636f6e74656e7473206f6620626c6f636b2032203d2038383037395d0a202020202020656e636f64656444617461202b3d2027323027" +
+"3b0a202020202020656e636f64656444617461202b3d20696e7465676572546f486578566172696e74286f626a6563742e4c696e6b735b6a5d2e436f6e74656e7453697a65293b0a202020207d0a2020" +
+"7d20656c7365207b0a202020202f2f206469726563746f72790a20202020656e636f64656444617461202b3d2027303827202b20273031273b0a20207d0a0a20202f2f20536f6d6520736f7274206f66" +
+"20736570617261746f72206f72207465726d696e61746f720a2020726573756c74202b3d20273061273b0a202076617220656e636f6465644461746153697a65203d20656e636f646564446174612e6c" +
+"656e677468202f20323b0a2020726573756c74202b3d20696e7465676572546f486578566172696e7428656e636f6465644461746153697a65293b0a2020726573756c74202b3d20656e636f64656444" +
+"6174613b0a0a202072657475726e20726573756c743b0a7d0a0a66756e6374696f6e206970667348617368576974684c696e6b7328626173652c206f626a65637429207b0a202076617220626c6f636b" +
+"203d20686578537472696e67546f496e74656765724c6973742869706673426c6f636b576974684c696e6b73286f626a65637429293b0a20207661722068617368203d20736861323536496e74656765" +
+"724c697374546f4d756c74696861736828626173652c2073686132353628626c6f636b29293b0a20206966202862617365203d3d20313629207b0a2020202072657475726e207b20226861736822203a" +
+"20696e74656765724c697374546f4c6f776572636173654261736531364d756c7469626173652868617368292c2022626c6f636b22203a20626c6f636b207d3b0a20207d20656c7365207b0a20202020" +
+"72657475726e207b20226861736822203a20696e74656765724c697374546f4c6f776572636173654261736533324d756c7469626173652868617368292c2022626c6f636b22203a20626c6f636b207d" +
+"3b0a20207d0a7d0a0a2f2f205265706c6163652074686520666f6c6c6f77696e6720737472696e6720627920225858585f504c414345484f4c4445525f585858222c207468656e20636f6e7665727420" +
+"7468652066696c6520746f2068657861646563696d616c0a2f2f2077697468206865784c696e655769647468206e6962626c657320706572206c696e652c2065616368206c696e6520666f726d617474" +
+"656420776974686f757420616e7920696e64656e746174696f6e2061730a2f2f20226162636465663030616263646566e280a622202b0a2f2f2065786365707420666f7220746865206c617374206c69" +
+"6e6520666f726d61747465642061730a2f2f20226162636465663030616263646566e280a6223b0a2f2f20616e6420746865206669727374206c696e652077686963682073746172747320696d6d6564" +
+"696174656c7920616674657220746865203d207369676e2e0a7661722073726331203d20225858585f504c414345484f4c4445525f585858223b0a766172206865784c696e655769647468203d203136" +
+"303b0a0a66756e6374696f6e20666f726d617448657864756d70286865784c696e6557696474682c207372633129207b0a202076617220666f726d617474656448657864756d70203d205b5d3b0a2020" +
+"766172206a203d20303b0a2020666f7220287661722069203d20303b2069203c20737263312e6c656e6774683b20692b3d6865784c696e65576964746829207b0a20202020666f726d61747465644865" +
+"7864756d705b6a2b2b5d203d20737263312e737562737472696e6728692c20692b6865784c696e655769647468293b0a20207d0a202072657475726e20227661722073726331203d205c2222202b2066" +
+"6f726d617474656448657864756d702e6a6f696e282722202b5c6e222729202b2027223b273b0a7d0a0a7661722073726332203d20737263312e7265706c6163652875746638537472696e67546f4865" +
+"7828227661722073726331203d205c225858585f504c414345484f4c4445525f5858585c223b22292c2075746638537472696e67546f48657828666f726d617448657864756d70286865784c696e6557" +
+"696474682c20737263312929293b0a0a646f63756d656e742e676574456c656d656e7442794964282773656c662d73726327292e696e6e657254657874203d20737263323b0a0a76617220696e646578" +
+"5f68746d6c203d206970667348617368576974684c696e6b732831362c207b0a2020224c696e6b73223a205b5d2c0a202022697346696c65223a20747275652c0a20202246696c65223a20737263320a" +
+"7d2c203136293b0a0a76617220726f6f74203d206970667348617368576974684c696e6b732833322c207b0a2020224c696e6b73223a205b0a202020207b0a202020202020224e616d65223a2022426c" +
+"6f622e6a73222c0a2020202020202f2f20663132323034343932336634613863306139623361313730633336383934663165623038393062346363343061646135333836376664626634356462656338" +
+"6632303639350a2020202020202248617368223a2022516d53784b6d7463427842526b6d6b4c47706e58414772526331366b50724a7835486d64737674364c5257655347222c0a202020202020225369" +
+"7a65223a2032313833330a202020207d2c0a202020207b0a202020202020224e616d65223a202246696c6553617665722e6a73222c0a2020202020202248617368223a2022516d55676732484c6f3457" +
+"396270663932436b48483657575646666732446d4e714a727a325a34364c37566d5571222c0a2020202020202253697a65223a20373336370a202020207d2c0a202020207b0a202020202020224e616d" +
+"65223a20224a535a6970222c0a2020202020202248617368223a2022516d575732684450724d553565354b6753414d6971664d325957355253695a7a57694e4a5351377736336e67694c222c0a202020" +
+"2020202253697a65223a203432323039340a202020207d2c0a202020207b0a202020202020224e616d65223a2022524541444d45222c0a2020202020202248617368223a2022516d5056705473673244" +
+"6d56716e4357525675613376676756416f594c4b7a5a5050674766355a517a7a56557766222c0a2020202020202253697a65223a203436340a202020207d2c0a202020207b0a202020202020224e616d" +
+"65223a202256697a2e6a73222c0a2020202020202248617368223a2022516d617855437531676e4677545470446f5441504233664d51516176314e4a5a725a374c47714c58454369644b6a222c0a2020" +
+"202020202253697a65223a20333536343431300a202020207d2c0a202020207b0a202020202020224e616d65223a2022636f64656d6972726f722d352e36302e30222c0a202020202020224861736822" +
+"3a2022516d58506241724d416964384d6243354737484379577a3250556b66534d575a615551706e713633783844773279222c0a2020202020202253697a65223a20343636393630340a202020207d2c" +
+"0a202020207b0a202020202020224e616d65223a20226465706c6f792e7368222c0a2020202020202248617368223a2022516d5071627739666e574550384854436763317a6b4a745431367373345854" +
+"344d673975365761794136784d6555222c0a2020202020202253697a65223a20313535330a202020207d2c0a202020207b0a202020202020224e616d65223a20226769742d7475746f7269616c2e6373" +
+"73222c0a2020202020202248617368223a2022516d647357673452565a52336b524137784663686f574c4551517a4c707a5679737054744b776139717474444d46222c0a2020202020202253697a6522" +
+"3a2031303834320a202020207d2c0a202020207b0a202020202020224e616d65223a20226769742d7475746f7269616c2e6a73222c0a2020202020202248617368223a2022516d6263414d4175477946" +
+"756d7a347048744b4d6e525932567952417232745a6f6959424c664e593370326b436a222c0a2020202020202253697a65223a2034373038330a202020207d2c0a202020207b0a202020202020224e61" +
+"6d65223a2022696e6465782e68746d6c222c0a2020202020202248617368223a20696e6465785f68746d6c2e686173682c0a2020202020202253697a65223a20696e6465785f68746d6c2e626c6f636b" +
+"2e6c656e6774680a202020207d2c0a202020207b0a202020202020224e616d65223a202270616b6f222c0a2020202020202248617368223a2022516d52744a687532724a436535394a50533955697941" +
+"6a613569555a4e6d4a386e7942696a645a704c4c45674739222c0a2020202020202253697a65223a203137383433310a202020207d2c0a202020207b0a202020202020224e616d65223a202273686131" +
+"2e6a73222c0a2020202020202248617368223a2022516d5037485050595171774b58597944726b446d39764b7438465a4531577344554a4738634c6e6a466634613131222c0a2020202020202253697a" +
+"65223a20373936360a202020207d0a20205d2c0a20202244617461223a20225c625c7530303031220a7d293b0a0a646f63756d656e742e777269746528273c6120687265663d22697066733a2f2f2720" +
+"2b20726f6f742e68617368202b202722223e5065726d616c696e6b20746f20746869732066696c653a20697066733a2f2f272b726f6f742e686173682b273c2f613e27293b0a0a0a3c2f736372697074" +
+"3e0a3c2f626f64793e0a3c2f68746d6c3e0a";
+var hexLineWidth = 160;
+
+function formatHexdump(hexLineWidth, src1) {
+  var formattedHexdump = [];
+  var j = 0;
+  for (var i = 0; i < src1.length; i+=hexLineWidth) {
+    formattedHexdump[j++] = src1.substring(i, i+hexLineWidth);
+  }
+  return "var src1 = \"" + formattedHexdump.join('" +\n"') + '";';
+}
+
+var src2 = src1.replace(utf8StringToHex("var src1 = \"XXX_PLACEHOLDER_XXX\";"), utf8StringToHex(formatHexdump(hexLineWidth, src1)));
+
+document.getElementById('self-src').innerText = src2;
+
+var index_html = ipfsHashWithLinks(16, {
+  "Links": [],
+  "isFile": true,
+  "File": src2
+}, 16);
+
+var root = ipfsHashWithLinks(32, {
+  "Links": [
+    {
+      "Name": "Blob.js",
+      // f122044923f4a8c0a9b3a170c36894f1eb0890b4cc40ada53867fdbf45dbec8f20695
+      "Hash": "QmSxKmtcBxBRkmkLGpnXAGrRc16kPrJx5Hmdsvt6LRWeSG",
+      "Size": 21833
+    },
+    {
+      "Name": "FileSaver.js",
+      "Hash": "QmUgg2HLo4W9bpf92CkHH6WWVFfg2DmNqJrz2Z46L7VmUq",
+      "Size": 7367
+    },
+    {
+      "Name": "JSZip",
+      "Hash": "QmWW2hDPrMU5e5KgSAMiqfM2YW5RSiZzWiNJSQ7w63ngiL",
+      "Size": 422094
+    },
+    {
+      "Name": "README",
+      "Hash": "QmPVpTsg2DmVqnCWRVua3vggVAoYLKzZPPgGf5ZQzzVUwf",
+      "Size": 464
+    },
+    {
+      "Name": "Viz.js",
+      "Hash": "QmaxUCu1gnFwTTpDoTAPB3fMQQav1NJZrZ7LGqLXECidKj",
+      "Size": 3564410
+    },
+    {
+      "Name": "codemirror-5.60.0",
+      "Hash": "QmXPbArMAid8MbC5G7HCyWz2PUkfSMWZaUQpnq63x8Dw2y",
+      "Size": 4669604
+    },
+    {
+      "Name": "deploy.sh",
+      "Hash": "QmPqbw9fnWEP8HTCgc1zkJtT16ss4XT4Mg9u6WayA6xMeU",
+      "Size": 1553
+    },
+    {
+      "Name": "git-tutorial.css",
+      "Hash": "QmdsWg4RVZR3kRA7xFchoWLEQQzLpzVyspTtKwa9qttDMF",
+      "Size": 10842
+    },
+    {
+      "Name": "git-tutorial.js",
+      "Hash": "QmbcAMAuGyFumz4pHtKMnRY2VyRAr2tZoiYBLfNY3p2kCj",
+      "Size": 47083
+    },
+    {
+      "Name": "index.html",
+      "Hash": index_html.hash,
+      "Size": index_html.block.length
+    },
+    {
+      "Name": "pako",
+      "Hash": "QmRtJhu2rJCe59JPS9UiyAja5iUZNmJ8nyBijdZpLLEgG9",
+      "Size": 178431
+    },
+    {
+      "Name": "sha1.js",
+      "Hash": "QmP7HPPYQqwKXYyDrkDm9vKt8FZE1WsDUJG8cLnjFf4a11",
+      "Size": 7966
+    }
+  ],
+  "Data": "\b\u0001"
+});
+
+document.write('<a href="ipfs://' + root.hash + '"">Permalink to this file: ipfs://'+root.hash+'</a>');
+
+
+</script>
+</body>
+</html>
diff --git a/a b/a
new file mode 100644
index 0000000..d70db60
--- /dev/null
+++ b/a
@@ -0,0 +1 @@
+7661722073726331203d20223363363837343664366333653061336336383635363136343365306133633664363537343631323036383734373437303264363537313735363937363364323234333666366537343635366537343264353437393730363532323230363336663665373436353665373433643232373436353738373432663638373436643663336232303633363836313732373336353734336437353734363632643338323222202b0a223230326633653061336332663638363536313634336530613363363236663634373933653061336337303732363532303639363433643232373336353663363632643733373236333232336533633266373037323635336530613363323132643264336337333633373236393730373432303733373236333364323237333638363133323335333632653661373332323365336332663733363337323639373022202b0a223734336532643264336530613363373336333732363937303734336530613736363137323230373336383631333233353336323033643230323836363735366536333734363936663665323832393230376230613230323032303230326632663230353334383431326433323335333632303636366637323230346136313736363135333633373236393730373432653061323032303230323032663266306122202b0a223230323032303230326632663230353737323639373437343635366532303639366532303332333033313334326433323330333133363230363237393230343436643639373437323739323034333638363537333734366537393662363832653061323032303230323032663266323034643666363436393636363936353634323036363732366636643230363837343734373037333361326632663637363922202b0a223734363837353632326536333666366432663634363336383635373337343266363636313733373432643733363836313332333533363264366137333266363236633666363232663332363336353635333336333633363233393337333736323634333436323331333036353338363536353632333736363631333933353330333333363632333136343330333836363332333533323339326637333638363122202b0a223332333533363265366137333230363936653230333233303332333132303632373932303533373537613631366536653635323035333666373930613230323032303230326632663230353536653663363936333635366537333635306132303230323032303266326632303530373536323663363936333230363436663664363136393665326332303665366632303737363137323732363136653734373922202b0a223265306132303230323032303266326630613230323032303230326632663230343637353665363337343639366636653230373336383631333233353336323836643635373337333631363736353239323032643365323036383631373336383230363136333633363537303734373332303631366536343230373236353734373537323665373332303631366532303535363936653734333834313732373222202b0a223631373930613230323032303230373636313732323036343639363736353733373434633635366536373734363832303364323033333332336230613230323032303230373636313732323036323663366636333662353336393761363532303364323033363334336230613230323032303230326632663230353334383431326433323335333632303633366636653733373436313665373437333061323022202b0a223230323032303736363137323230346232303364323036653635373732303535363936653734333333323431373237323631373932383562306132303230323032303230323032303230333037383334333233383631333236363339333832633230333037383337333133333337333433343339333132633230333037383632333536333330363636323633363632633230333037383635333936323335363422202b0a223632363133353263323033303738333333393335333636333332333536323263306132303230323032303230323032303230333037383335333936363331333133313636333132633230333037383339333233333636333833323631333432633230333037383631363233313633333536353634333532633230333037383634333833303337363136313339333832633230333037383331333233383333333522202b0a223632333033313263306132303230323032303230323032303230333037383332333433333331333833353632363532633230333037383335333533303633333736343633333332633230333037383337333236323635333536343337333432633230333037383338333036343635363233313636363532633230333037383339363236343633333033363631333732633061323032303230323032303230323022202b0a223230333037383633333133393632363633313337333432633230333037383635333433393632333633393633333132633230333037383635363636323635333433373338333632633230333037383330363636333331333936343633333632633230333037383332333433303633363133313633363332633061323032303230323032303230323032303330373833323634363533393332363333363636326322202b0a223230333037383334363133373334333833343631363132633230333037383335363336323330363133393634363332633230333037383337333636363339333833383634363132633230333037383339333833333635333533313335333232633061323032303230323032303230323032303330373836313338333333313633333633363634326332303330373836323330333033333332333736333338326322202b0a223230333037383632363633353339333736363633333732633230333037383633333636353330333036323636333332633230333037383634333536313337333933313334333732633061323032303230323032303230323032303330373833303336363336313336333333353331326332303330373833313334333233393332333933363337326332303330373833323337363233373330363133383335326322202b0a223230333037383332363533313632333233313333333832633230333037383334363433323633333636343636363332633061323032303230323032303230323032303330373833353333333333383330363433313333326332303330373833363335333036313337333333353334326332303330373833373336333636313330363136323632326332303330373833383331363333323633333933323635326322202b0a223230333037383339333233373332333236333338333532633061323032303230323032303230323032303330373836313332363236363635333836313331326332303330373836313338333136313336333633343632326332303330373836333332333436323338363233373330326332303330373836333337333636333335333136313333326332303330373836343331333933323635333833313339326322202b0a223061323032303230323032303230323032303330373836343336333933393330333633323334326332303330373836363334333036353333333533383335326332303330373833313330333636313631333033373330326332303330373833313339363133343633333133313336326332303330373833313635333333373336363333303338326330613230323032303230323032303230323033303738333222202b0a223337333433383337333733343633326332303330373833333334363233303632363336323335326332303330373833333339333136333330363336323333326332303330373833343635363433383631363133343631326332303330373833353632333936333633363133343636326330613230323032303230323032303230323033303738333633383332363533363636363633333263323033303738333722202b0a223334333836363338333236353635326332303330373833373338363133353336333333363636326332303330373833383334363333383337333833313334326332303330373833383633363333373330333233303338326330613230323032303230323032303230323033303738333933303632363536363636363636313263323033303738363133343335333033363633363536323263323033303738363222202b0a223635363633393631333336363337326332303330373836333336333733313337333836363332306132303230323032303564323933623061323032303230323037363631373232303638363137333638343236633666363336623733323033643230363637353665363337343639366636653238373732633230373632633230373032633230373036663733326332303663363536653239323037623061323022202b0a223230323032303230323032303230373636313732323036313263323036323263323036333263323036343263323036353263323036363263323036373263323036383263323037353263323036393263323036613263323037343331326332303734333233623061323032303230323032303230323032303737363836393663363532303238366336353665323033653364323033363334323932303762306122202b0a223230323032303230323032303230323032303230323032303631323033643230373635623330356433623061323032303230323032303230323032303230323032303230363232303364323037363562333135643362306132303230323032303230323032303230323032303230323036333230336432303736356233323564336230613230323032303230323032303230323032303230323032303634323022202b0a223364323037363562333335643362306132303230323032303230323032303230323032303230323036353230336432303736356233343564336230613230323032303230323032303230323032303230323032303636323033643230373635623335356433623061323032303230323032303230323032303230323032303230363732303364323037363562333635643362306132303230323032303230323022202b0a223230323032303230323032303638323033643230373635623337356433623061323032303230323032303230323032303230323032303230363636663732323032383639323033643230333033623230363932303363323033313336336232303639326232623239323037623061323032303230323032303230323032303230323032303230323032303230323036613230336432303730366637333230326222202b0a223230363932303261323033343362306132303230323032303230323032303230323032303230323032303230323032303737356236393564323033643230323832383238373035623661356432303236323033303738363636363239323033633363323033323334323932303763323032383238373035623661323032623230333135643230323632303330373836363636323932303363336332303331333622202b0a223239323037633061323032303230323032303230323032303230323032303230323032303230323032303230323032303238323837303562366132303262323033323564323032363230333037383636363632393230336333633230333832393230376332303238373035623661323032623230333335643230323632303330373836363636323932393362306132303230323032303230323032303230323022202b0a223230323032303764306132303230323032303230323032303230323032303230323036363666373232303238363932303364323033313336336232303639323033633230333633343362323036393262326232393230376230613230323032303230323032303230323032303230323032303230323032303230373532303364323037373562363932303264323033323564336230613230323032303230323022202b0a223230323032303230323032303230323032303230323037343331323033643230323837353230336533653365323033313337323037633230373532303363336332303238333333323230326432303331333732393239323035653230323837353230336533653365323033313339323037633230373532303363336332303238333333323230326432303331333932393239323035653230323837353230336522202b0a223365336532303331333032393362306132303230323032303230323032303230323032303230323032303230323032303735323033643230373735623639323032643230333133353564336230613230323032303230323032303230323032303230323032303230323032303230373433323230336432303238373532303365336533653230333732303763323037353230336333633230323833333332323022202b0a223264323033373239323932303565323032383735323033653365336532303331333832303763323037353230336333633230323833333332323032643230333133383239323932303565323032383735323033653365336532303333323933623061323032303230323032303230323032303230323032303230323032303230323037373562363935643230336432303238373433313230326232303737356222202b0a223639323032643230333735643230376332303330323932303262323032383734333232303262323037373562363932303264323033313336356432303763323033303239336230613230323032303230323032303230323032303230323032303764306132303230323032303230323032303230323032303230323036363666373232303238363932303364323033303362323036393230336332303336333422202b0a223362323036393262326232393230376230613230323032303230323032303230323032303230323032303230323032303230373433313230336432303238323832383238323836353230336533653365323033363230376332303635323033633363323032383333333232303264323033363239323932303565323032383635323033653365336532303331333132303763323036353230336333633230323822202b0a223333333232303264323033313331323932393230356530613230323032303230323032303230323032303230323032303230323032303230323032303230323032383635323033653365336532303332333532303763323036353230336333633230323833333332323032643230333233353239323932393230326232303238323836353230323632303636323932303565323032383765363532303236323022202b0a223637323932393239323037633230333032393230326230613230323032303230323032303230323032303230323032303230323032303230323032303230323032383238363832303262323032383238346235623639356432303262323037373562363935643239323037633230333032393239323037633230333032393239323037633230333033623061323032303230323032303230323032303230323022202b0a223230323032303230323032303734333232303364323032383238323836313230336533653365323033323230376332303631323033633363323032383333333232303264323033323239323932303565323032383631323033653365336532303331333332303763323036313230336333633230323833333332323032643230333133333239323932303565306132303230323032303230323032303230323022202b0a223230323032303230323032303230323032303230323032383631323033653365336532303332333232303763323036313230336333633230323833333332323032643230333233323239323932393230326232303238323836313230323632303632323932303565323032383631323032363230363332393230356532303238363232303236323036333239323932393230376332303330336230613230323022202b0a223230323032303230323032303230323032303230323032303230323036383230336432303637336230613230323032303230323032303230323032303230323032303230323032303230363732303364323036363362306132303230323032303230323032303230323032303230323032303230323032303636323033643230363533623061323032303230323032303230323032303230323032303230323022202b0a223230323032303635323033643230323836343230326232303734333132393230376332303330336230613230323032303230323032303230323032303230323032303230323032303230363432303364323036333362306132303230323032303230323032303230323032303230323032303230323032303633323033643230363233623061323032303230323032303230323032303230323032303230323022202b0a223230323032303632323033643230363133623061323032303230323032303230323032303230323032303230323032303230323036313230336432303238373433313230326232303734333232393230376332303330336230613230323032303230323032303230323032303230323032303764306132303230323032303230323032303230323032303230323037363562333035643230326233643230363122202b0a223362306132303230323032303230323032303230323032303230323037363562333135643230326233643230363233623061323032303230323032303230323032303230323032303230373635623332356432303262336432303633336230613230323032303230323032303230323032303230323032303736356233333564323032623364323036343362306132303230323032303230323032303230323022202b0a223230323032303736356233343564323032623364323036353362306132303230323032303230323032303230323032303230323037363562333535643230326233643230363633623061323032303230323032303230323032303230323032303230373635623336356432303262336432303637336230613230323032303230323032303230323032303230323032303736356233373564323032623364323022202b0a223638336230613230323032303230323032303230323032303230323032303730366637333230326233643230333633343362306132303230323032303230323032303230323032303230323036633635366532303264336432303336333433623061323032303230323032303230323032303764306132303230323032303230323032303230373236353734373537323665323037303666373333623061323022202b0a223230323032303764306132303230323032303266326632303438363137333638323036393664373036633635366436353665373437333230353334383431333233353336323036383631373336383230363136633637366637323639373436383664326530613230323032303230373636313732323034383631373336383230336432303266326132613230343036333663363137333733323032613266323022202b0a223238363637353665363337343639366636653230323832393230376230613230323032303230323032303230323036363735366536333734363936663665323034383631373336383238323932303762306132303230323032303230323032303230323032303230323037343638363937333265363436393637363537333734346336353665363737343638323033643230363436393637363537333734346322202b0a223635366536373734363833623061323032303230323032303230323032303230323032303230373436383639373332653632366336663633366235333639376136353230336432303632366336663633366235333639376136353362306132303230323032303230323032303230323032303230323032663266323034653666373436353361323034393665373433333332343137323732363137393230363922202b0a223733323037353733363536343230363936653733373436353631363432303666363632303535363936653734333333323431373237323631373932303636366637323230373036353732363636663732366436313665363336353230373236353631373336663665373332653061323032303230323032303230323032303230323032303230373436383639373332653733373436313734363532303364323022202b0a223665363537373230343936653734333333323431373237323631373932383338323933623230326632663230363836313733363832303733373436313734363530613230323032303230323032303230323032303230323032303734363836393733326537343635366437303230336432303665363537373230343936653734333333323431373237323631373932383336333432393362323032663266323022202b0a223734363536643730366637323631373237393230373337343631373436353061323032303230323032303230323032303230323032303230373436383639373332653632373536363636363537323230336432303665363537373230353536393665373433383431373237323631373932383331333233383239336232303266326632303632373536363636363537323230363636663732323036343631373422202b0a223631323037343666323036383631373336383061323032303230323032303230323032303230323032303230373436383639373332653632373536363636363537323463363536653637373436383230336432303330336232303266326632303665373536643632363537323230366636363230363237393734363537333230363936653230363237353636363636353732306132303230323032303230323022202b0a223230323032303230323032303734363836393733326536323739373436353733343836313733363836353634323033643230333033623230326632663230366537353664363236353732323036663636323037343666373436313663323036323739373436353733323036383631373336383635363430613230323032303230323032303230323032303230323032303734363836393733326536363639366522202b0a223639373336383635363432303364323036363631366337333635336232303266326632303639366536343639363336313734363537333230373736383635373436383635373232303734363836353230363836313733363832303737363137333230363636393665363136633639376136353634306132303230323032303230323032303230323032303230323037343638363937333265373236353733363522202b0a223734323832393362306132303230323032303230323032303230376430613230323032303230323032303230323032663266323035323635373336353734373332303638363137333638323037333734363137343635323036643631366236393665363732303639373432303730366637333733363936323663363530613230323032303230323032303230323032663266323037343666323037323635326422202b0a223735373336353230373436383639373332303639366537333734363136653633363532303734366632303638363137333638323036663734363836353732323036343631373436313265306132303230323032303230323032303230343836313733363832653730373236663734366637343739373036353265373236353733363537343230336432303636373536653633373436393666366532303238323922202b0a223230376230613230323032303230323032303230323032303230323032303734363836393733326537333734363137343635356233303564323033643230333037383336363133303339363533363336333733623061323032303230323032303230323032303230323032303230373436383639373332653733373436313734363535623331356432303364323033303738363236323336333736313635333822202b0a223335336230613230323032303230323032303230323032303230323032303734363836393733326537333734363137343635356233323564323033643230333037383333363333363635363633333337333233623061323032303230323032303230323032303230323032303230373436383639373332653733373436313734363535623333356432303364323033303738363133353334363636363335333322202b0a223631336230613230323032303230323032303230323032303230323032303734363836393733326537333734363137343635356233343564323033643230333037383335333133303635333533323337363633623061323032303230323032303230323032303230323032303230373436383639373332653733373436313734363535623335356432303364323033303738333936323330333533363338333822202b0a223633336230613230323032303230323032303230323032303230323032303734363836393733326537333734363137343635356233363564323033643230333037383331363633383333363433393631363233623061323032303230323032303230323032303230323032303230373436383639373332653733373436313734363535623337356432303364323033303738333536323635333036333634333122202b0a223339336230613230323032303230323032303230323032303230323032303734363836393733326536323735363636363635373234633635366536373734363832303364323033303362306132303230323032303230323032303230323032303230323037343638363937333265363237393734363537333438363137333638363536343230336432303330336230613230323032303230323032303230323022202b0a223230323032303230373436383639373332653636363936653639373336383635363432303364323036363631366337333635336230613230323032303230323032303230323032303230323032303732363537343735373236653230373436383639373333623061323032303230323032303230323032303764336230613230323032303230323032303230323032663266323034333663363536313665373322202b0a223230363936653734363537323665363136633230363237353636363636353732373332303631366536343230373236353264363936653639373436393631366336393761363537333230363836313733363832303733373436313734363532653061323032303230323032303230323032303438363137333638326537303732366637343666373437393730363532653633366336353631366532303364323022202b0a223636373536653633373436393666366532303238323932303762306132303230323032303230323032303230323032303230323036363666373232303238373636313732323036393230336432303330336232303639323033633230373436383639373332653632373536363636363537323265366336353665363737343638336232303639326232623239323037623061323032303230323032303230323022202b0a223230323032303230323032303230323032303734363836393733326536323735363636363635373235623639356432303364323033303362306132303230323032303230323032303230323032303230323037643061323032303230323032303230323032303230323032303230363636663732323032383736363137323230363932303364323033303362323036393230336332303734363836393733326522202b0a223734363536643730326536633635366536373734363833623230363932623262323932303762306132303230323032303230323032303230323032303230323032303230323032303734363836393733326537343635366437303562363935643230336432303330336230613230323032303230323032303230323032303230323032303764306132303230323032303230323032303230323032303230323022202b0a223734363836393733326537323635373336353734323832393362306132303230323032303230323032303230376433623061323032303230323032303230323032303266326632303535373036343631373436353733323036383631373336383230373337343631373436353230373736393734363832303734363836353230363736393736363536653230363436313734363132653061323032303230323022202b0a223230323032303230326632663061323032303230323032303230323032303266326632303466373037343639366636653631366336633739326332303663363536653637373436383230366636363230373436383635323036343631373436313230363336313665323036323635323037333730363536333639363636393635363432303734366632303638363137333638306132303230323032303230323022202b0a223230323032663266323036363635373736353732323036323739373436353733323037343638363136653230363436313734363132653663363536653637373436383265306132303230323032303230323032303230326632663061323032303230323032303230323032303266326632303534363837323666373737333230363537323732366637323230373736383635366532303734373237393639366522202b0a223637323037343666323037353730363436313734363532303631366337323635363136343739323036363639366536313663363937613635363432303638363137333638336130613230323032303230323032303230323032663266323036393665373337343631366536333635323036643735373337343230363236353230373236353733363537343230373436663230373537333635323036393734323022202b0a223631363736313639366532653061323032303230323032303230323032303438363137333638326537303732366637343666373437393730363532653735373036343631373436353230336432303636373536653633373436393666366532303238363436313734363132633230363436313734363134633635366536373734363832393230376230613230323032303230323032303230323032303230323022202b0a223230363936363230323836343631373436313463363536653637373436383230336433643364323037363666363936343230333032393230376232303634363137343631346336353665363737343638323033643230363436313734363132653663363536653637373436383362323037643061323032303230323032303230323032303230323032303230363936363230323837343638363937333265363622202b0a223639366536393733363836353634323932303762306132303230323032303230323032303230323032303230323032303230323032303734363837323666373732303665363537373230343537323732366637323238323235333438343133323335333633613230363336313665323737343230373537303634363137343635323036323635363336313735373336353230363836313733363832303737363122202b0a223733323036363639366536393733363836353634326532323239336230613230323032303230323032303230323032303230323032303764306132303230323032303230323032303230323032303230323037363631373232303634363137343631353036663733323033643230333033623061323032303230323032303230323032303230323032303230373436383639373332653632373937343635373322202b0a223438363137333638363536343230326233643230363436313734363134633635366536373734363833623061323032303230323032303230323032303230323032303230363936363230323837343638363937333265363237353636363636353732346336353665363737343638323033653230333032393230376230613230323032303230323032303230323032303230323032303230323032303230373722202b0a223638363936633635323032383734363836393733326536323735363636363635373234633635366536373734363832303363323033363334323032363236323036343631373436313463363536653637373436383230336532303330323932303762306132303230323032303230323032303230323032303230323032303230323032303230323032303230373436383639373332653632373536363636363522202b0a223732356237343638363937333265363237353636363636353732346336353665363737343638326232623564323033643230363436313734363135623634363137343631353036663733326232623564336230613230323032303230323032303230323032303230323032303230323032303230323032303230323036343631373436313463363536653637373436383264326433623061323032303230323022202b0a223230323032303230323032303230323032303230323032303764306132303230323032303230323032303230323032303230323032303230323032303639363632303238373436383639373332653632373536363636363537323463363536653637373436383230336433643364323033363334323932303762306132303230323032303230323032303230323032303230323032303230323032303230323022202b0a223230323036383631373336383432366336663633366237333238373436383639373332653734363536643730326332303734363836393733326537333734363137343635326332303734363836393733326536323735363636363635373232633230333032633230333633343239336230613230323032303230323032303230323032303230323032303230323032303230323032303230323037343638363922202b0a223733326536323735363636363635373234633635366536373734363832303364323033303362306132303230323032303230323032303230323032303230323032303230323032303764306132303230323032303230323032303230323032303230323037643061323032303230323032303230323032303230323032303230363936363230323836343631373436313463363536653637373436383230336522202b0a223364323033363334323932303762306132303230323032303230323032303230323032303230323032303230323032303634363137343631353036663733323033643230363836313733363834323663366636333662373332383734363836393733326537343635366437303263323037343638363937333265373337343631373436353263323036343631373436313263323036343631373436313530366622202b0a223733326332303634363137343631346336353665363737343638323933623061323032303230323032303230323032303230323032303230323032303230323036343631373436313463363536653637373436383230323533643230333633343362306132303230323032303230323032303230323032303230323037643061323032303230323032303230323032303230323032303230373736383639366322202b0a223635323032383634363137343631346336353665363737343638323033653230333032393230376230613230323032303230323032303230323032303230323032303230323032303230373436383639373332653632373536363636363537323562373436383639373332653632373536363636363537323463363536653637373436383262326235643230336432303634363137343631356236343631373422202b0a223631353036663733326232623564336230613230323032303230323032303230323032303230323032303230323032303230363436313734363134633635366536373734363832643264336230613230323032303230323032303230323032303230323032303764306132303230323032303230323032303230323032303230323037323635373437353732366532303734363836393733336230613230323022202b0a223230323032303230323032303764336230613230323032303230323032303230323032663266323034363639366536313663363937613635373332303638363137333638323037333734363137343635323036313665363432303730373537343733323036383631373336383230363936653734366632303666373537343265306132303230323032303230323032303230326632663061323032303230323022202b0a223230323032303230326632663230343936363230363836313733363832303737363137333230363136633732363536313634373932303636363936653631366336393761363536343263323037303735373437333230373436383635323037333631366436353230373636313663373536353265306132303230323032303230323032303230343836313733363832653730373236663734366637343739373022202b0a223635326536363639366536393733363832303364323036363735366536333734363936663665323032383666373537343239323037623061323032303230323032303230323032303230323032303230363936363230323832313734363836393733326536363639366536393733363836353634323932303762306132303230323032303230323032303230323032303230323032303230323032303736363122202b0a223732323036323739373436353733343836313733363836353634323033643230373436383639373332653632373937343635373334383631373336383635363433623061323032303230323032303230323032303230323032303230323032303230323037363631373232303663363536363734323033643230373436383639373332653632373536363636363537323463363536653637373436383362306122202b0a223230323032303230323032303230323032303230323032303230323032303230373636313732323036323639373434633635366534383639323033643230323836323739373436353733343836313733363836353634323032663230333037383332333033303330333033303330333032393230376332303330336230613230323032303230323032303230323032303230323032303230323032303230373622202b0a223631373232303632363937343463363536653463366632303364323036323739373436353733343836313733363836353634323033633363323033333362306132303230323032303230323032303230323032303230323032303230323032303736363137323230373036313634346336353665363737343638323033643230323836323739373436353733343836313733363836353634323032353230333622202b0a223334323033633230333533363239323033663230333633343230336132303331333233383362306132303230323032303230323032303230323032303230323032303230323032303734363836393733326536323735363636363635373235623663363536363734356432303364323033303738333833303362306132303230323032303230323032303230323032303230323032303230323032303636366622202b0a223732323032383736363137323230363932303364323036633635363637343230326232303331336232303639323033633230373036313634346336353665363737343638323032643230333833623230363932623262323932303762306132303230323032303230323032303230323032303230323032303230323032303230323032303230373436383639373332653632373536363636363537323562363922202b0a223564323033643230333033623061323032303230323032303230323032303230323032303230323032303230323037643061323032303230323032303230323032303230323032303230323032303230323037343638363937333265363237353636363636353732356237303631363434633635366536373734363832303264323033383564323033643230323836323639373434633635366534383639323022202b0a223365336533653230333233343239323032363230333037383636363633623061323032303230323032303230323032303230323032303230323032303230323037343638363937333265363237353636363636353732356237303631363434633635366536373734363832303264323033373564323033643230323836323639373434633635366534383639323033653365336532303331333632393230323622202b0a223230333037383636363633623061323032303230323032303230323032303230323032303230323032303230323037343638363937333265363237353636363636353732356237303631363434633635366536373734363832303264323033363564323033643230323836323639373434633635366534383639323033653365336532303338323932303236323033303738363636363362306132303230323022202b0a223230323032303230323032303230323032303230323032303230373436383639373332653632373536363636363537323562373036313634346336353665363737343638323032643230333535643230336432303238363236393734346336353665343836393230336533653365323033303239323032363230333037383636363633623061323032303230323032303230323032303230323032303230323022202b0a223230323032303734363836393733326536323735363636363635373235623730363136343463363536653637373436383230326432303334356432303364323032383632363937343463363536653463366632303365336533653230333233343239323032363230333037383636363633623061323032303230323032303230323032303230323032303230323032303230323037343638363937333265363222202b0a223735363636363635373235623730363136343463363536653637373436383230326432303333356432303364323032383632363937343463363536653463366632303365336533653230333133363239323032363230333037383636363633623061323032303230323032303230323032303230323032303230323032303230323037343638363937333265363237353636363636353732356237303631363422202b0a223463363536653637373436383230326432303332356432303364323032383632363937343463363536653463366632303365336533653230333832393230323632303330373836363636336230613230323032303230323032303230323032303230323032303230323032303230373436383639373332653632373536363636363537323562373036313634346336353665363737343638323032643230333122202b0a223564323033643230323836323639373434633635366534633666323033653365336532303330323932303236323033303738363636363362306132303230323032303230323032303230323032303230323032303230323032303638363137333638343236633666363336623733323837343638363937333265373436353664373032633230373436383639373332653733373436313734363532633230373422202b0a223638363937333265363237353636363636353732326332303330326332303730363136343463363536653637373436383239336230613230323032303230323032303230323032303230323032303230323032303230373436383639373332653636363936653639373336383635363432303364323037343732373536353362306132303230323032303230323032303230323032303230323037643061323022202b0a223230323032303230323032303230323032303230323036363666373232303238373636313732323036393230336432303330336232303639323033633230333833623230363932623262323932303762306132303230323032303230323032303230323032303230323032303230323032303666373537343562363932303261323033343230326232303330356432303364323032383734363836393733326522202b0a223733373436313734363535623639356432303365336533653230333233343239323032363230333037383636363633623061323032303230323032303230323032303230323032303230323032303230323036663735373435623639323032613230333432303262323033313564323033643230323837343638363937333265373337343631373436353562363935643230336533653365323033313336323922202b0a223230323632303330373836363636336230613230323032303230323032303230323032303230323032303230323032303230366637353734356236393230326132303334323032623230333235643230336432303238373436383639373332653733373436313734363535623639356432303365336533653230333832393230323632303330373836363636336230613230323032303230323032303230323022202b0a223230323032303230323032303230323036663735373435623639323032613230333432303262323033333564323033643230323837343638363937333265373337343631373436353562363935643230336533653365323033303239323032363230333037383636363633623061323032303230323032303230323032303230323032303230376430613230323032303230323032303230323032303230323022202b0a223230373236353734373537323665323037343638363937333362306132303230323032303230323032303230376433623061323032303230323032303230323032303266326632303532363537343735373236653733323037343638363532303636363936653631366332303638363137333638323036343639363736353733373432653061323032303230323032303230323032303438363137333638326522202b0a223730373236663734366637343739373036353265363436393637363537333734323033643230363637353665363337343639366636653230323832393230376230613230323032303230323032303230323032303230323032303736363137323230366637353734323033643230366536353737323035353639366537343338343137323732363137393238373436383639373332653634363936373635373322202b0a223734346336353665363737343638323933623061323032303230323032303230323032303230323032303230373436383639373332653636363936653639373336383238366637353734323933623061323032303230323032303230323032303230323032303230373236353734373537323665323036663735373433623061323032303230323032303230323032303764336230613230323032303230323022202b0a223230323032303732363537343735373236653230343836313733363833623061323032303230323037643238323932393362306132303230323032303266326632303532363537343735373236653733323035333438343133323335333632303638363137333638323036663636323036343631373436313265306132303230323032303736363137323230363836313733363832303364323036363735366522202b0a223633373436393666366532383634363137343631323932303762306132303230323032303230323032303230373636313732323036383230336432303238366536353737323034383631373336383238323932393265373537303634363137343635323836343631373436313239336230613230323032303230323032303230323037363631373232303634363936373635373337343230336432303638326522202b0a223634363936373635373337343238323933623061323032303230323032303230323032303638326536333663363536313665323832393362306132303230323032303230323032303230373236353734373537323665323036343639363736353733373433623061323032303230323037643061323032303230323037323635373437353732366532303638363137333638336230613764323932383239336222202b0a223061336332663733363337323639373037343365306133633733363337323639373037343365306136363735366536333734363936663665323036383635373835363631373236393665373435343666343936653734363536373635373232383733373437323239323037623061323032303736363137323230373332303364323035333734373236393665363732383733373437323239336230613230323022202b0a223736363137323230373436663734363136633230336432303330336230613230323037363631373232303666363636363733363537343230336432303331336230613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230373332653663363536653637373436383362323036393230326233643230333232393230376230613230323032303230373622202b0a223631373232303632373937343635323033643230373036313732373336353439366537343238373332653733373536323733373437323639366536373238363932633230363932623332323932633230333133363239336230613230323032303230373636313732323036393733346336313733373432303364323036653735366336633362306132303230323032303639363632303238363237393734363522202b0a223230336533643230333133323338323932303762306132303230323032303230323036323739373436353230326433643230333133323338336230613230323032303230323032303639373334633631373337343230336432303636363136633733363533623061323032303230323037643230363536633733363532303762306132303230323032303230323036393733346336313733373432303364323022202b0a223734373237353635336230613230323032303230376430613230323032303230373436663734363136633230326233643230363237393734363532303261323036663636363637333635373433623061323032303230323036663636363637333635373432303261336432303464363137343638326537303666373732383332326333373239336230613230323037643061323032303732363537343735373222202b0a223665323037343666373436313663336230613764306130613636373536653633373436393666366532303638363537383533373437323639366536373534366634393665373436353637363537323463363937333734323837333734373232393230376230613230323037363631373232303733323033643230353337343732363936653637323837333734373232393362306132303230373636313732323022202b0a223732363537333735366337343230336432303562356433623061323032303636366637323230323837363631373232303639323033643230333033623230363932303363323037333265366336353665363737343638336232303639326233643332323932303762306132303230323032303732363537333735366337343562363932663332356432303364323037303631373237333635343936653734323822202b0a223733326537333735363237333734373236393665363732383639326332303639326233323239326332303331333632393362306132303230376430613230323037323635373437353732366532303732363537333735366337343362306137643061306136363735366536333734363936663665323037333638363133323335333634393665373436353637363537323463363937333734353436663464373522202b0a223663373436393638363137333638323836323631373336353263323036633733373432393230376230613230323032663266323033303738333233303230363937333230373436383635323036633635366536373734363832303666363632303734363836353230363836313733363832653061323032303736363137323230363932303364323033303362306132303230373636313732323037323635373322202b0a223735366337343230336432303562356433623061323032303639363632303238363236313733363532303364336432303333333232393230376230613230323032303230326632663230343636663732323037333666366436353230373236353631373336663665323037343638363537333635323036313732363532303730373236353733363536653734323036393665323037343638363532303632363122202b0a223733363533333332323034333439343437333230363237353734323036653666373432303639366532303734363836353230363236313733363533313336323034333439343437333061323032303230323037323635373337353663373435623639326232623564323033643230373036313732373336353439366537343238323733303331323732633230333133363239336230613230323032303230373222202b0a223635373337353663373435623639326232623564323033643230373036313732373336353439366537343238323733373330323732633230333133363239336230613230323037643061323032303732363537333735366337343562363932623262356432303364323037303631373237333635343936653734323832373331333232373263323033313336323933623061323032303732363537333735366322202b0a223734356236393262326235643230336432303730363137323733363534393665373432383237333233303237326332303331333632393362306132303230363636663732323032383736363137323230366132303364323033303362323036613230336332303663373337343265366336353665363737343638336232303661326232623239323037623061323032303230323037323635373337353663373422202b0a223562366132623639356432303364323036633733373435623661356433623061323032303764306132303230373236353734373537323665323037323635373337353663373433623061376430613061363637353665363337343639366636653230363936653734363536373635373234633639373337343534366634633666373736353732363336313733363534323631373336353331333634643735366322202b0a223734363936323631373336353238366337333734323932303762306132303230373636313732323037323635373337353663373432303364323032373237336230613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230366337333734326536633635366536373734363833623230363932623262323932303762306132303230323032303736363122202b0a223732323036383635373832303364323036633733373435623639356432653734366635333734373236393665363732383331333632393362306132303230323032303639363632303238363836353738326536633635366536373734363832303363323033323239323037623230363836353738323033643230323733303237323032623230363836353738336232303764306132303230323032303732363522202b0a223733373536633734323032623364323036383635373833623061323032303764306132303230373236353734373537323665323032373636323732303262323037323635373337353663373433623061376430613061363637353665363337343639366636653230363936653734333834633639373337343534366634323639373434633639373337343238366337333734323932303762306132303230373622202b0a223631373232303732363537333735366337343230336432303562356433623061323032303636366637323230323837363631373232303639323033643230333033623230363932303363323036633733373432653663363536653637373436383362323036393262326232393230376230613230323032303230373236353733373536633734356236393261333832623330356432303364323032383663373322202b0a223734356236393564323032363230333133323338323932303366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333832623331356432303364323032383663373337343562363935643230323632303336333432393230336632303331323033613230333033623061323032303230323037323635373337353663373435623639326133383262333222202b0a223564323033643230323836633733373435623639356432303236323033333332323932303366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333832623333356432303364323032383663373337343562363935643230323632303331333632393230336632303331323033613230333033623061323032303230323037323635373337353663373422202b0a223562363932613338326233343564323033643230323836633733373435623639356432303236323033383239323033663230333132303361323033303362306132303230323032303732363537333735366337343562363932613338326233353564323033643230323836633733373435623639356432303236323033343239323033663230333132303361323033303362306132303230323032303732363522202b0a223733373536633734356236393261333832623336356432303364323032383663373337343562363935643230323632303332323932303366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333832623337356432303364323032383663373337343562363935643230323632303331323932303366323033313230336132303330336230613230323022202b0a223764306132303230373236353734373537323665323037323635373337353663373433623061376430613061363637353665363337343639366636653230363236313733363533333332353337343732363936653637353436663432363937343463363937333734323837333734373232393230376230613230323037363631373232303632363137333635343336383631373237333230336432303237363122202b0a223632363336343635363636373638363936613662366336643665366637303731373237333734373537363737373837393761333233333334333533363337323733623061323032303736363137323230373332303364323035333734373236393665363732383733373437323239336230613230323037363631373232303732363537333735366337343230336432303562356433623061323032303636366622202b0a223732323032383736363137323230363932303364323033303362323036393230336332303733326536633635366536373734363833623230363932623262323932303762306132303230323032303736363137323230373036313732373432303364323036323631373336353433363836313732373332653639366536343635373834663636323837333562363935643239336230613230323032303230326622202b0a223266363636663732323032383736363137323230366132303364323033303362323036613230336332303336336232303661326232623239323037623061323032303230323032663266323032303732363537333735366337343562363932613336326236613564323033643230323837303631373237343230323632303464363137343638326537303666373732383332326332303336326433313264366122202b0a223239323932303366323033313230336132303330336230613230323032303230326632663764306132303230323032303732363537333735366337343562363932613335326233303564323033643230323837303631373237343230323632303331333632393230336632303331323033613230333033623061323032303230323037323635373337353663373435623639326133353262333135643230336422202b0a223230323837303631373237343230323632303338323932303366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333532623332356432303364323032383730363137323734323032363230333432393230336632303331323033613230333033623061323032303230323037323635373337353663373435623639326133353262333335643230336422202b0a223230323837303631373237343230323632303332323932303366323033313230336132303330336230613230323032303230373236353733373536633734356236393261333532623334356432303364323032383730363137323734323032363230333132393230336632303331323033613230333033623061323032303764306132303230373236353734373537323665323037323635373337353663373422202b0a223362306137643061306132663266323036383734373437303733336132663266363736393733373432653637363937343638373536323265363336663664326636343639363136363739363736393266333933303631333336353338333036333631333136333332333733393333333233323330363533353266326332303737373436363730366330613736363137323230363637323666366435663632333522202b0a223338323033643230363637353665363337343639366636653238353332633431323937623736363137323230363433643562356432633632336435623564326336393263366132633633326336653362363636663732323836393230363936653230353332393762366133643330326336333364343132653639366536343635373834663636323835333562363935643239336236393636323836333363333022202b0a223239373236353734373537323665323037353665363436353636363936653635363433623633376337633632326536633635366536373734363835653639336636393361363232653730373537333638323833303239336237373638363936633635323836613230363936653230363437633763363332393762366533643634356236613564336236653364366533663665326133353338326236333361363322202b0a223362363333643665336533653338336236343562366135643364366532353332333533363362366132623262376437643737363836393663363532383661326432643239363232653730373537333638323836343562366135643239336237323635373437353732366532303665363537373230353536393665373433383431373237323631373932383632323937643362306130613636373536653633373422202b0a223639366636653230363236313733363533353338353337343732363936653637353436663438363537383533373437323639366536373238373337343732323932303762306132303230373636313732323036323631373336353433363836313732373332303364323032373331333233333334333533363337333833393431343234333434343534363437343834613462346334643465353035313532353322202b0a223534353535363537353835393561363136323633363436353636363736383639366136623664366536663730373137323733373437353736373737383739376132373362306132303230373636313732323036393665373437333230336432303636373236663664356636323335333832383533373437323639366536373238373337343732323932633230363236313733363534333638363137323733323922202b0a223362306132303230373636313732323037323635373337353663373432303364323032373237336230613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230363936653734373332653663363536653637373436383362323036393262326232393230376230613230323032303230373636313732323036383635373832303364323036393665373422202b0a223733356236393564326537343666353337343732363936653637323833313336323933623061323032303230323036393636323032383638363537383265366336353665363737343638323033633230333232393230376232303638363537383230336432303237333032373230326232303638363537383362323037643061323032303230323037323635373337353663373432303262336432303638363522202b0a223738336230613230323037643061323032303732363537343735373236653230373236353733373536633734336230613764306130613636373536653633373436393666366532303639366537343635363736353732346336393733373435343666346336663737363537323633363137333635343236313733363533333332346437353663373436393632363137333635323836633733373432393230376222202b0a223061323032303736363137323230363236313733363534333638363137323733323033643230323736313632363336343635363636373638363936613662366336643665366637303731373237333734373537363737373837393761333233333334333533363337323733623061323032303736363137323230373236353733373536633734323033643230323732373362306132303230373636313732323022202b0a223663323033643230363936653734333834633639373337343534366634323639373434633639373337343238366337333734323933623061306132303230363636663732323032383736363137323230363932303364323033303362323036393230336332303663326536633635366536373734363833623230363932623364323033353239323037623061323032303230323037363631373232303637363522202b0a223734323033643230363637353665363337343639366636653238366132393230376232303732363537343735373236653230323832383639326236613239323033633230366332653663363536653637373436383239323033663230366335623639326236613564323033613230333033623230376433623061323032303230323037363631373232303730363137323734323033643230363736353734323822202b0a223330323932303261323033313336323032623230363736353734323833313239323032613230333832303262323036373635373432383332323932303261323033343230326232303637363537343238333332393230326132303332323032623230363736353734323833343239323032613230333133623061323032303230323037323635373337353663373432303262336432303632363137333635343322202b0a223638363137323733356237303631373237343564336230613230323037643061323032303732363537343735373236653230323736323237323032623230373236353733373536633734336230613764306130613636373536653633373436393666366532303632363137333635333333323533373437323639366536373534366634323631373336353331333634633666373736353732363336313733363522202b0a223464373536633734363936323631373336353238373337343732323932303762306132303230373636313732323036323631373336353433363836313732373332303364323032373330333133323333333433353336333733383339363136323633363436353636323733623061323032303736363137323230373236353733373536633734323033643230323732373362306132303230373636313732323022202b0a223663323033643230363236313733363533333332353337343732363936653637353436663432363937343463363937333734323837333734373232393362306130613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230366332653663363536653637373436383362323036393262336432303334323932303762306132303230323032303736363122202b0a223732323036373635373432303364323036363735366536333734363936663665323836613239323037623230373236353734373537323665323032383238363932623661323932303363323036633265366336353665363737343638323932303366323036633562363932623661356432303361323033303362323037643362306132303230323032303736363137323230373036313732373432303364323022202b0a223637363537343238333032393230326132303338323032623230363736353734323833313239323032613230333432303262323036373635373432383332323932303261323033323230326232303637363537343238333332393230326132303331336230613230323032303230373236353733373536633734323032623364323036323631373336353433363836313732373335623730363137323734356422202b0a223362306132303230376430613230323037323635373437353732366532303237363632373230326232303732363537333735366337343362306137643061306136363735366536333734363936663665323036393665373436353637363537323534366634383635373835363631373236393665373432383639323932303762306132303230326632663230353436383639373332303636373536653633373422202b0a223639366636653230373436313662363537333230363132303461363137363631353336333732363937303734323036393665373436353637363537323230363136653634323037323635373437353732366537333230363132303638363537383631363436353633363936643631366332303733373437323639366536373230373236353730373236353733363536653734363936653637323037343638363122202b0a223734323036393665373436353637363537323230363536653633366636343635363432303631373332303631323037303732366637343666363237353636323037363631373236393665373432303631363336333666373236343639366536373230373436663230373436383635323037323735366336353733323036353738373036633631363936653635363432303631373430613230323032663266323022202b0a223638373437343730373333613266326636343635373636353663366637303635373237333265363736663666363736633635326536333666366432663730373236663734366636333666366332643632373536363636363537323733326636343666363337333266363536653633366636343639366536373061323032303736363137323230373236353733373536633734323033643230323732373362306122202b0a223230323036393636323032383639323033633230333032393230376230613230323032303230373436383732366637373230323234653635363736313734363937363635323036393665373436353637363537323733323036313732363532303733373537303730366637323734363536343230363237393230353636313732363936653734373332303632373537343230366536663734323036323739323022202b0a223734363836393733323036393664373036633635366436353665373436313734363936663665326532323362306132303230376432303635366337333635323036393636323032383639323033643364323033303239323037623061323032303230323037323635373437353732366532303237333033303237336230613230323037643230363536633733363532303762306132303230323032303737363822202b0a223639366336353230323836393230336532303330323932303762306132303230323032303230323032663266323034373635373432303734363836353230366336353631373337343230373336393637366536393636363936333631366537343230333732303632363937343733323032383330326532653331333233373239323036663636323037343638363532303639366537343635363736353732323022202b0a223631366536343230373336383639363637343230373436383635323037323635373337343061323032303230323032303230373636313732323036633635363137333734353336393637366536393636363936333631366537343432363937343733323033643230363932303236323033313332333733623061323032303230323032303230363932303364323036393230336533653230333733623061323022202b0a223230323032303230323032663266323036393636323037343638363937333230363937333230366536663734323037343638363532303663363137333734323036333638373536653662326332303733363537343230373436383635323036643666373337343230373336393637366536393636363936333631366537343230363236393734323037343666323036393665363436393633363137343635323022202b0a223734363836313734323037343638363532303736363136633735363532303737363936633663323036323635323036333666366537343639366537353635363432303639366532303734363836353230366536353738373432303632373937343635323837333239326530613230323032303230323032303639363632303238363932303365323033303239323037623230366336353631373337343533363922202b0a223637366536393636363936333631366537343432363937343733323037633364323033313332333833623230376430613230323032303230323032303266326632303433366636653736363537323734323037343666323036383635373836313634363536333639366436313663323036313665363432303730363136343230373736393734363832303330323037343666323036373635373432303734373722202b0a223666323036343639363736393734373332303639363632303665363536353634363536343061323032303230323032303230373636313732323036383635373832303364323036633635363137333734353336393637366536393636363936333631366537343432363937343733326537343666353337343732363936653637323833313336323933623061323032303230323032303230363936363230323822202b0a223638363537383265366336353665363737343638323033633230333232393230376232303638363537383230336432303237333032373230326232303638363537383362323037643061323032303230323032303230373236353733373536633734323032623364323036383635373833623061323032303230323037643061323032303230323037323635373437353732366532303732363537333735366322202b0a223734336230613230323037643061376430613061363637353665363337343639366636653230373537343636333835333734373236393665363735343666343836353738323837333734373232393230376230613230323032663266323035343638363532303639366537303735373432303664373537333734323036313663373236353631363437393230363236353230363132303733373437323639366522202b0a223637323036363666373232303737363836393633363832303265363336383631373234333666363436353431373432383239323036313663373736313739373332303732363537343735373236653733323036313230373636313663373536353230336333323335333632303238363932653635326532303631323037333734373236393665363732303635366536333666363436353634323036393665373422202b0a223666323037353734363632643338323036313665363432303734363836663733363532303736363136633735363537333230373236353264363536653633366636343635363432303639366537343666323036613631373636313733363337323639373037343237373332303639366537343635373236653631366332303735373436363264333133363239306132303230373636313732323037333230336422202b0a223230353337343732363936653637323837333734373232393362306132303230373636313732323037323635373337353663373432303364323032373237336230613230323036363666373232303238373636313732323036393230336432303330336232303639323033633230373332653663363536653637373436383362323036393262326232393230376230613230323032303230373636313732323022202b0a223638363537383230336432303733326536333638363137323433366636343635343137343238363932393265373436663533373437323639366536373238333133363239336230613230323032303230363936363230323836383635373832653663363536653637373436383230336332303332323932303762323036383635373832303364323032373330323732303262323036383635373833623230376422202b0a223061323032303230323037323635373337353663373432303262336432303638363537383362306132303230376430613230323037323635373437353732366532303732363537333735366337343362306137643061306136363735366536333734363936663665323036393730363637333432366336663633366235373639373436383463363936653662373332383666363236613635363337343239323022202b0a223762306132303230326632663230366636323661363536333734323037333638366637353663363432303632363532303631366532303762323032323463363936653662373332323361323036633639366536623733326332303232343436313734363132323361323036383635373832643635366536333666363436353634323037333734373236393665363732303764323036663632366136353633373422202b0a223061323032303266326632303431373336393634363532303636373236663664323036353665363336663634363936653637323036343639363636363635373236353665363336353733326332303639373432303733363836663735366336343230366436313734363336383230373436383635323036333666366537343635366537343733323036663636323037343638363532303232363937303636373322202b0a223230366636323661363536333734323036373635373432303264326436343631373436313264363536653633366636343639366536373364363236313733363533363334323035313664653238306136363836313733363832323230363336663664366436313665363430613230323032663266306132303230326632663230323234633639366536623733323232303733363836663735366336343230363222202b0a223635323036313665323036313732373236313739323036663636323037623230323734383631373336383237336132303633363936343736333134323631373336353331333634633666373736353732363336313733363532633230323735333639376136353237336132303439366537343635363736353732323037643230366636323661363536333734373332653061323032303266326632303534363822202b0a223639373332303636373536653633373436393666366537333230373236353734373537323665373332303631323036383635373836313634363536333639366436313663323037333734373236393665363732303737363836393633363832303635366536333666363436353733323037343638363532303639373036363733323036323663366636333662323037373639373436383230373436383635323022202b0a223637363937363635366532303663363936653662373332653061323032303266326632303534363836393733323036393733323036313230373036313732373436393631366332303639366437303663363536643635366537343631373436393666366532303737363836393633363832303639373332303632363137323635366337393230373337353636363636393633363936353665373432303636366622202b0a223732323037323635326436383631373336383639366536373230363132303636363936633635326332303664363136653739323036663636323037343638363532303633366636653636363936373735373236313632366336353230373636313663373536353733323036313732363532303638363137323634363336663634363536343265306132303230326632663230343132303531366465323830613622202b0a223638363137333638323036333631366532303632363532303633366636653736363537323734363536343230373436663230363132303232343334393434373633313230363236313733363533313336323036633666373736353732363336313733363532323230363836313733363832303666366532303734363836353230363336663664366436313665363432643663363936653635323037353733363922202b0a223665363732303734363836353230363636663663366336663737363936653637323036333666363436353361306132303230326632663230323032303639373036363733323036333639363432303636366637323664363137343230326437363230333132303264363232303632363137333635333133363230326436363364323732353664323732303531366465323830613636383631373336383061323022202b0a223230326632663061323032303266326632303232343636393663363532323230373336383666373536633634323036323635323037343638363532303638363537383264363536653633366636343635363432303238363236313733363532303331333632633230366336663737363537323633363137333635326332303665366632303730373236353636363937383239323036343631373436313263323022202b0a223666373232303232363636313663373336353232323037373638363536653230373436383635323036353665373437323739323036393733323036653666373432303631323034343431343732303663363536313636306132303230326632663061323032303266326632303534363836353230323234343631373436313232323036363639363536633634323036313733323036373639373636353665323022202b0a223632373932303734363836353230363636663663366336663737363936653637323036333666366436643631366536343061323032303266326632303230323036393730363637333230366636323661363536333734323036373635373432303264326436343631373436313264363536653633366636343639366536373364363236313733363533363334323035313664653238306136363836313733363822202b0a223230376332303661373132303264373232303237326534343631373436313237323037633230363236313733363533363334323032643634323037633230373837383634323032643730373330613230323032663266323036393733323036313735373436663664363137343639363336313663366337393230363736353665363537323631373436353634323037353733363936653637323037343638363522202b0a223230323234363639366336353232323036363639363536633634323036393636323037303732363537333635366537343230363136653634323037343638363532303736363137323639366637353733323037333639376136353733323036353734363332653061306132303230373636313732323036633639366536623733323033643230366636323661363536333734326534633639366536623733336222202b0a223061323032303736363137323230363636393663363534383635373832303364323036663632366136353633373432653436363936633635336230613230323037363631373232303732363537333735366337343230336432303237323733623061306132303230363636663732323032383736363137323230363932303364323033303362323036393230336332303663363936653662373332653663363522202b0a223665363737343638336232303639326232623239323037623061323032303230323037363631373232303633363936343230336432303663363936653662373335623639356432653438363137333638336230613230323032303230373636313732323037333639376136353230336432303663363936653662373335623639356432653533363937613635336230613230323032303230373636313732323022202b0a223665363136643635323033643230366336393665366237333562363935643265346536313664363533623061323032303230323037363631373232303636363936633635343836353738323033643230366636323661363536333734326534363639366336353362306130613230323032303230373236353733373536633734323032623364323032373331333232373362306130613230323032303230373622202b0a223631373232303635366536333666363436353634346336393665366232303364323032373237306132303230323032303266326632303533366636643635323037333666373237343230366636363230373336353730363137323631373436663732323036663732323037343635373236643639366536313734366637323061323032303230323036353665363336663634363536343463363936653662323022202b0a223262336432303237333036313237336230613061323032303230323032663266323037333639376136353230366636363230373436383635323034333439343432303238333333323230363237393734363537333230326232303332323036323739373436353733323036383635363136343635373232303364323033333334323036323739373436353733323033643230333233323230363936653230363822202b0a223635373832393061323032303230323036353665363336663634363536343463363936653662323032623364323032373332333232373362306130613230323032303230363936363230323836333639363435623330356432303231336432303237363632373230376337633230363336393634326536633635366536373734363832303231336432303336333932393230376230613230323032303230323022202b0a223230363936363230323836333639363435623330356432303364336432303237353132373230323632363230363336393634356233313564323033643364323032373664323732303236323632303633363936343265366336353665363737343638323033643364323033343336323932303762306132303230323032303230323032303230363336393634323033643230323736363237323032623230363222202b0a223631373336353335333835333734373236393665363735343666343836353738353337343732363936653637323836333639363432393362306132303230323032303230323032303230363936363230323836333639363435623330356432303231336432303237363632373230376337633230363336393634326536633635366536373734363832303231336432303336333932393230376230613230323022202b0a223230323032303230323032303230323037343638373236663737323032323439366537343635373236653631366332303635373237323666373232323362306132303230323032303230323032303230376430613230323032303230323032303764323036353663373336353230376230613230323032303230323032303230323037343638373236663737323032323435373837303635363337343635363422202b0a223230363132303663366637373635373236333631373336353230363236313733363533313336323034333439343437363331323036663732323036313230353136646532383061363638363137333638323036393665323036323631373336353335333832303238366336353665363737343638323033343336323932653230353436383635323036323631373336353331333632303635366536333666363422202b0a223639366536373230373336383666373536633634323037333734363137323734323037373639373436383230323736363237323232303262306132303230323032303230323032303230326632613262326132663230323232303631366536343230363836313736363532303631323036633635366536373734363832303666363632303333333232303632373937343635373332303238333633343230363822202b0a223635373836313634363536333639366436313663323036333638363137323631363337343635373237333239323037303663373537333230373436383635323036633635363136343639366536373230373037323635363636393738323032373636333133323332333032373230323836633635366536373734363832303666363632303336333932303633363836313732363136333734363537323733323022202b0a223639366532303734366637343631366332393232323032623061323032303230323032303230323032303266326132623261326632303232323036313733323036343635373336333732363936323635363432303639366532303638373437343730373333613266326636373639373436383735363232653633366636643266366437353663373436393636366637323664363137343733326636643735366322202b0a223734363936323631373336353265323035343638363532303637363937363635366532303638363137333638323037333734363137323734363536343230373736393734363832303232323032623230363336393634356233303564323032623230323232303631366536343230363836313634323036313230366336353665363737343638323036663636323032323230326232303633363936343265366322202b0a223635366536373734363833623061323032303230323032303230376430613230323032303230376430613061323032303230323032663266323034313634363432303734363836353230343334393434326530613230323032303230363536653633366636343635363434633639366536623230326233643230363336393634326537333735363237333734373236393665363732383331323933623061306122202b0a223230323032303230326632663230343136343634323036313230373336353633366636653634323036383631373236343633366636343635363432303730363137323734323036663636323037343638363532303635366536333666363436393665363732653061323032303230323036353665363336663634363536343463363936653662323032623364323032373331333232373362306132303230323022202b0a223230326632663230366336353665363737343638323036663636323036363639366336353665363136643635306132303230323032303635366536333666363436353634346336393665366232303262336432303639366537343635363736353732353436663438363537383536363137323639366537343238366536313664363532653663363536653637373436383239336230613230323032303230363522202b0a223665363336663634363536343463363936653662323032623364323037353734363633383533373437323639366536373534366634383635373832383665363136643635323933623061306132303230323032303635366536333666363436353634346336393665366232303262336432303237333133383237336230613061323032303230323032663266323034313634363432303734363836353230373322202b0a223639376136353265306132303230323032303635366536333666363436353634346336393665366232303262336432303639366537343635363736353732353436663438363537383536363137323639366537343238373336393761363532393362306130613230323032303230373636313732323036353665363336663634363536343463363936653662353336393761363532303364323036353665363322202b0a223666363436353634346336393665366232653663363536653637373436383266333230613230323032303230373236353733373536633734323032623364323036393665373436353637363537323534366634383635373835363631373236393665373432383635366536333666363436353634346336393665366235333639376136353239336230613230323032303230373236353733373536633734323022202b0a223262336432303635366536333666363436353634346336393665366233623061323032303764306130613230323032663266323034373635366536353732363137343635323037343638363532303232343436313734363132323230363636393635366336343061306132303230373636313732323037343666373436313663353336393761363532303364323032383636363936633635343836353738323022202b0a223763376332303237323732393265366336353665363737343638323032663230333233623061323032303636366637323230323837363631373232303639323033643230333033623230363932303363323036663632366136353633373432653463363936653662373332653663363536653637373436383362323036393262326232393230376230613230323032303230373436663734363136633533363922202b0a223761363532303262336432303666363236613635363337343265346336393665366237333562363935643265343336663665373436353665373435333639376136353362306132303230376430613061323032303736363137323230363536653633366636343635363434343631373436313230336432303237323733623061323032303639363632303238366636323661363536333734326536393733343622202b0a223639366336353239323037623061323032303230323032663266323032303230323032303230323032303230323032303230323032373330333832373230323032303237333033323237306132303230323032303635366536333666363436353634343436313734363132303262336432303237333033383237323032623230323733303332323733623061323032303230323032663266323036363639363522202b0a223663363432303331333232303733363536353664373332303734366632303632363532303666373037343639366636653631366332303238363636663732323034343431343732303665366636343635373332303737363937343638323036633639366536623733323032383637373236663735373037333230366636363230363236633666363336623733323036313665363432303634363937323635363322202b0a223734366637323639363537333239323930613230323032303230363936363230323836363639366336353438363537383230323133643364323036363631366337333635323932303762306132303230323032303230323036353665363336663634363536343434363137343631323032623364323032373331333232373362306132303230323032303230323036353665363336663634363536343434363122202b0a223734363132303262336432303639366537343635363736353732353436663438363537383536363137323639366537343238373436663734363136633533363937613635323933623061323032303230323032303230363536653633366636343635363434343631373436313230326233643230363636393663363534383635373833623061323032303230323037643061323032303230323032663266323022202b0a223230323032303230323032303230323032303230323032373331333832373230356233383636323036323330323033313335323033643230373436663734363136633230373336393761363532303666363632303633366636653734363536653734373332303666363632303734363836353230363636393663363532303364323033333335333033323332333333303330356430613230323032303230363522202b0a223665363336663634363536343434363137343631323032623364323032373331333832373230326232303639366537343635363736353732353436663438363537383536363137323639366537343238373436663734363136633533363937613635323933623061323032303230323036363666373232303238373636313732323036613230336432303330336232303661323033633230366636323661363522202b0a223633373432653463363936653662373332653663363536653637373436383362323036613262326232393230376230613230323032303230323032303266326632303332333032303562333833303230333833303230333133303230336432303733363937613635323036663636323036333666366537343635366537343733323036663636323036323663366636333662323033313230336432303332333622202b0a223332333133343334356430613230323032303230323032303266326632303332333032303562333836363230363233303230333033353230336432303733363937613635323036663636323036333666366537343635366537343733323036663636323036323663366636333662323033323230336432303338333833303337333935643061323032303230323032303230363536653633366636343635363422202b0a223434363137343631323032623364323032373332333032373362306132303230323032303230323036353665363336663634363536343434363137343631323032623364323036393665373436353637363537323534366634383635373835363631373236393665373432383666363236613635363337343265346336393665366237333562366135643265343336663665373436353665373435333639376122202b0a223635323933623061323032303230323037643061323032303764323036353663373336353230376230613230323032303230326632663230363436393732363536333734366637323739306132303230323032303635366536333666363436353634343436313734363132303262336432303237333033383237323032623230323733303331323733623061323032303764306130613230323032663266323022202b0a223533366636643635323037333666373237343230366636363230373336353730363137323631373436663732323036663732323037343635373236643639366536313734366637323061323032303732363537333735366337343230326233643230323733303631323733623061323032303736363137323230363536653633366636343635363434343631373436313533363937613635323033643230363522202b0a223665363336663634363536343434363137343631326536633635366536373734363832303266323033323362306132303230373236353733373536633734323032623364323036393665373436353637363537323534366634383635373835363631373236393665373432383635366536333666363436353634343436313734363135333639376136353239336230613230323037323635373337353663373422202b0a223230326233643230363536653633366636343635363434343631373436313362306130613230323037323635373437353732366532303732363537333735366337343362306137643061306136363735366536333734363936663665323036393730363637333438363137333638353736393734363834633639366536623733323836323631373336353263323036663632366136353633373432393230376222202b0a223061323032303736363137323230363236633666363336623230336432303638363537383533373437323639366536373534366634393665373436353637363537323463363937333734323836393730363637333432366336663633366235373639373436383463363936653662373332383666363236613635363337343239323933623061323032303736363137323230363836313733363832303364323022202b0a223733363836313332333533363439366537343635363736353732346336393733373435343666346437353663373436393638363137333638323836323631373336353263323037333638363133323335333632383632366336663633366232393239336230613230323036393636323032383632363137333635323033643364323033313336323932303762306132303230323032303732363537343735373222202b0a223665323037623230323236383631373336383232323033613230363936653734363536373635373234633639373337343534366634633666373736353732363336313733363534323631373336353331333634643735366337343639363236313733363532383638363137333638323932633230323236323663366636333662323232303361323036323663366636333662323037643362306132303230376422202b0a223230363536633733363532303762306132303230323032303732363537343735373236653230376232303232363836313733363832323230336132303639366537343635363736353732346336393733373435343666346336663737363537323633363137333635343236313733363533333332346437353663373436393632363137333635323836383631373336383239326332303232363236633666363322202b0a223662323232303361323036323663366636333662323037643362306132303230376430613764306130613266326632303532363537303663363136333635323037343638363532303636366636633663366637373639366536373230373337343732363936653637323036323739323032323538353835383566353034633431343334353438346634633434343535323566353835383538323232633230373422202b0a223638363536653230363336663665373636353732373432303734363836353230363636393663363532303734366632303638363537383631363436353633363936643631366330613266326632303737363937343638323036383635373834633639366536353537363936343734363832303665363936323632366336353733323037303635373232303663363936653635326332303635363136333638323022202b0a223663363936653635323036363666373236643631373437343635363432303737363937343638366637353734323036313665373932303639366536343635366537343631373436393666366532303631373330613266326632303232363136323633363436353636333033303631363236333634363536366532383061363232323032623061326632663230363537383633363537303734323036363666373222202b0a223230373436383635323036633631373337343230366336393665363532303636366637323664363137343734363536343230363137333061326632663230323236313632363336343635363633303330363136323633363436353636653238306136323233623061326632663230363136653634323037343638363532303636363937323733373432303663363936653635323037373638363936333638323022202b0a223733373436313732373437333230363936643664363536343639363137343635366337393230363136363734363537323230373436383635323033643230373336393637366532653061373636313732323037333732363333313230336432303232353835383538356635303463343134333435343834663463343434353532356635383538353832323362306137363631373232303638363537383463363922202b0a223665363535373639363437343638323033643230333133363330336230613061363637353665363337343639366636653230363636663732366436313734343836353738363437353664373032383638363537383463363936653635353736393634373436383263323037333732363333313239323037623061323032303736363137323230363636663732366436313734373436353634343836353738363422202b0a223735366437303230336432303562356433623061323032303736363137323230366132303364323033303362306132303230363636663732323032383736363137323230363932303364323033303362323036393230336332303733373236333331326536633635366536373734363833623230363932623364363836353738346336393665363535373639363437343638323932303762306132303230323022202b0a223230363636663732366436313734373436353634343836353738363437353664373035623661326232623564323033643230373337323633333132653733373536323733373437323639366536373238363932633230363932623638363537383463363936653635353736393634373436383239336230613230323037643061323032303732363537343735373236653230323237363631373232303733373222202b0a223633333132303364323035633232323232303262323036363666373236643631373437343635363434383635373836343735366437303265366136663639366532383237323232303262356336653232323732393230326232303237323233623237336230613764306130613736363137323230373337323633333232303364323037333732363333313265373236353730366336313633363532383735373422202b0a223636333835333734373236393665363735343666343836353738323832323736363137323230373337323633333132303364323035633232353835383538356635303463343134333435343834663463343434353532356635383538353835633232336232323239326332303735373436363338353337343732363936653637353436663438363537383238363636663732366436313734343836353738363422202b0a223735366437303238363836353738346336393665363535373639363437343638326332303733373236333331323932393239336230613061363436663633373536643635366537343265363736353734343536633635366436353665373434323739343936343238323737333635366336363264373337323633323732393265363936653665363537323534363537383734323033643230373337323633333222202b0a223362306130613736363137323230363936653634363537383566363837343664366332303364323036393730363637333438363137333638353736393734363834633639366536623733323833313336326332303762306132303230323234633639366536623733323233613230356235643263306132303230323236393733343636393663363532323361323037343732373536353263306132303230323222202b0a223436363936633635323233613230373337323633333230613764326332303331333632393362306130613736363137323230373236663666373432303364323036393730363637333438363137333638353736393734363834633639366536623733323833333332326332303762306132303230323234633639366536623733323233613230356230613230323032303230376230613230323032303230323022202b0a223230323234653631366436353232336132303232343236633666363232653661373332323263306132303230323032303230323032663266323036363331333233323330333433343339333233333636333436313338363333303631333936323333363133313337333036333333333633383339333436363331363536323330333833393330363233343633363333343330363136343631333533333338333622202b0a223337363636343632363633343335363436323635363333383636333233303336333933353061323032303230323032303230323234383631373336383232336132303232353136643533373834623664373436333432373834323532366236643662346334373730366535383431343737323532363333313336366235303732346137383335343836643634373337363734333634633532353736353533343722202b0a223232326330613230323032303230323032303232353336393761363532323361323033323331333833333333306132303230323032303764326330613230323032303230376230613230323032303230323032303232346536313664363532323361323032323436363936633635353336313736363537323265366137333232326330613230323032303230323032303232343836313733363832323361323022202b0a223232353136643535363736373332343834633666333435373339363237303636333933323433366234383438333635373537353634363636363733323434366434653731346137323761333235613334333634633337353636643535373132323263306132303230323032303230323032323533363937613635323233613230333733333336333730613230323032303230376432633061323032303230323022202b0a223762306132303230323032303230323032323465363136643635323233613230323234613533356136393730323232633061323032303230323032303230323234383631373336383232336132303232353136643537353733323638343435303732346435353335363533353462363735333431346436393731363634643332353935373335353235333639356137613537363934653461353335313337373722202b0a223336333336653637363934633232326330613230323032303230323032303232353336393761363532323361323033343332333233303339333430613230323032303230376432633061323032303230323037623061323032303230323032303230323234653631366436353232336132303232353234353431343434643435323232633061323032303230323032303230323234383631373336383232336122202b0a223230323235313664353035363730353437333637333234343664353637313665343335373532353637353631333337363637363735363431366635393463346237613561353035303637343736363335356135313761376135363535373736363232326330613230323032303230323032303232353336393761363532323361323033343336333430613230323032303230376432633061323032303230323022202b0a223762306132303230323032303230323032323465363136643635323233613230323235363639376132653661373332323263306132303230323032303230323032323438363137333638323233613230323235313664363137383535343337353331363736653436373735343534373034343666353434313530343233333636346435313531363137363331346534613561373235613337346334373731346322202b0a223538343534333639363434623661323232633061323032303230323032303230323235333639376136353232336132303333333533363334333433313330306132303230323032303764326330613230323032303230376230613230323032303230323032303232346536313664363532323361323032323633366636343635366436393732373236663732326433353265333633303265333032323263306122202b0a223230323032303230323032303232343836313733363832323361323032323531366435383530363234313732346434313639363433383464363234333335343733373438343337393537376133323530353536623636353334643537356136313535353137303665373133363333373833383434373733323739323232633061323032303230323032303230323235333639376136353232336132303334333622202b0a223336333933363330333430613230323032303230376432633061323032303230323037623061323032303230323032303230323234653631366436353232336132303232363436353730366336663739326537333638323232633061323032303230323032303230323234383631373336383232336132303232353136643530373136323737333936363665353734353530333834383534343336373633333122202b0a223761366234613734353433313336373337333334353835343334346436373339373533363537363137393431333637383464363535353232326330613230323032303230323032303232353336393761363532323361323033313335333533333061323032303230323037643263306132303230323032303762306132303230323032303230323032323465363136643635323233613230323236373639373422202b0a223264373437353734366637323639363136633265363337333733323232633061323032303230323032303230323234383631373336383232336132303232353136643634373335373637333435323536356135323333366235323431333737383436363336383666353734633435353135313761346337303761353637393733373035343734346237373631333937313734373434343464343632323263306122202b0a223230323032303230323032303232353336393761363532323361323033313330333833343332306132303230323032303764326330613230323032303230376230613230323032303230323032303232346536313664363532323361323032323637363937343264373437353734366637323639363136633265366137333232326330613230323032303230323032303232343836313733363832323361323022202b0a223232353136643632363334313464343137353437373934363735366437613334373034383734346234643665353235393332353637393532343137323332373435613666363935393432346336363465353933333730333236623433366132323263306132303230323032303230323032323533363937613635323233613230333433373330333833333061323032303230323037643263306132303230323022202b0a223230376230613230323032303230323032303232346536313664363532323361323032323639366536343635373832653638373436643663323232633061323032303230323032303230323234383631373336383232336132303639366536343635373835663638373436643663326536383631373336383263306132303230323032303230323032323533363937613635323233613230363936653634363522202b0a223738356636383734366436633265363236633666363336623265366336353665363737343638306132303230323032303764326330613230323032303230376230613230323032303230323032303232346536313664363532323361323032323730363136623666323232633061323032303230323032303230323234383631373336383232336132303232353136643532373434613638373533323732346122202b0a223433363533353339346135303533333935353639373934313661363133353639353535613465366434613338366537393432363936613634356137303463346334353637343733393232326330613230323032303230323032303232353336393761363532323361323033313337333833343333333130613230323032303230376432633061323032303230323037623061323032303230323032303230323222202b0a223465363136643635323233613230323237333638363133313265366137333232326330613230323032303230323032303232343836313733363832323361323032323531366435303337343835303530353935313731373734623538353937393434373236623434366433393736346237343338343635613435333135373733343435353461343733383633346336653661343636363334363133313331323222202b0a223263306132303230323032303230323032323533363937613635323233613230333733393336333630613230323032303230376430613230323035643263306132303230323234343631373436313232336132303232356336323563373533303330333033313232306137643239336230613061363436663633373536643635366537343265373737323639373436353238323733633631323036383732363522202b0a223636336432323639373036363733336132663266323732303262323037323666366637343265363836313733363832303262323032373232323233653530363537323664363136633639366536623230373436663230373436383639373332303636363936633635336132303639373036363733336132663266323732623732366636663734326536383631373336383262323733633266363133653237323922202b0a22336230613061306133633266373336333732363937303734336530613363326636323666363437393365306133633266363837343664366333653061223b
diff --git a/i2.html b/i2.html
new file mode 100644
index 0000000..8d010ad
--- /dev/null
+++ b/i2.html
@@ -0,0 +1,78967 @@
+<html>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+<head>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+</head>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+<body>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+<pre id="self-src"></pre>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+<script src="sha256.js"></script>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+<script>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function hexVarintToInteger(str) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var s = String(str);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var total = 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var offset = 1;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < s.length; i += 2) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var byte = parseInt(s.substring(i, i+2), 16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var isLast = null;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    if (byte >= 128) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      byte -= 128;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      isLast = false;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    } else {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      isLast = true;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    total += byte * offset;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    offset *= Math.pow(2,7);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return total;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function hexStringToIntegerList(str) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var s = String(str);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = [];
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < s.length; i+=2) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i/2] = parseInt(s.substring(i, i+2), 16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function sha256IntegerListToMultihash(base, lst) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // 0x20 is the length of the hash.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var i = 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = [];
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  if (base == 32) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // For some reason these are present in the base32 CIDs but not in the base16 CIDs
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i++] = parseInt('01', 16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i++] = parseInt('70', 16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  result[i++] = parseInt('12', 16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  result[i++] = parseInt('20', 16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var j = 0; j < lst.length; j++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[j+i] = lst[j];
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function integerListToLowercaseBase16Multibase(lst) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = '';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < lst.length; i++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var hex = lst[i].toString(16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    if (hex.length < 2) { hex = '0' + hex; }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result += hex;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return 'f' + result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function int8ListToBitList(lst) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = [];
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < lst.length; i++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*8+0] = (lst[i] & 128) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*8+1] = (lst[i] & 64) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*8+2] = (lst[i] & 32) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*8+3] = (lst[i] & 16) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*8+4] = (lst[i] & 8) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*8+5] = (lst[i] & 4) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*8+6] = (lst[i] & 2) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*8+7] = (lst[i] & 1) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function base32StringToBitList(str) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var baseChars = 'abcdefghijklmnopqrstuvwxyz234567';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var s = String(str);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = [];
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < s.length; i++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var part = baseChars.indexOf(s[i]);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    //for (var j = 0; j < 6; j++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    //  result[i*6+j] = (part & Math.pow(2, 6-1-j)) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    //}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*5+0] = (part & 16) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*5+1] = (part & 8) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*5+2] = (part & 4) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*5+3] = (part & 2) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result[i*5+4] = (part & 1) ? 1 : 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+// https://gist.github.com/diafygi/90a3e80ca1c2793220e5/, wtfpl
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+var from_b58 = function(S,A){var d=[],b=[],i,j,c,n;for(i in S){j=0,c=A.indexOf(S[i]);if(c<0)return undefined;c||b.length^i?i:b.push(0);while(j in d||c){n=d[j];n=n?n*58+c:c;c=n>>8;d[j]=n%256;j++}}while(j--)b.push(d[j]);return new Uint8Array(b)};
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function base58StringToHexString(str) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var baseChars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var ints = from_b58(String(str), baseChars);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = '';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < ints.length; i++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var hex = ints[i].toString(16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    if (hex.length < 2) { hex = '0' + hex; }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result += hex;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function integerListToLowercaseBase32Multibase(lst) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var baseChars = 'abcdefghijklmnopqrstuvwxyz234567';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = '';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var l = int8ListToBitList(lst);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < l.length; i+= 5) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var get = function(j) { return ((i+j) < l.length) ? l[i+j] : 0; };
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var part = get(0) * 16 + get(1) * 8 + get(2) * 4 + get(3) * 2 + get(4) * 1;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result += baseChars[part];
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return 'b' + result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function base32StringToBase16LowercaseMultibase(str) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var baseChars = '0123456789abcdef';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = '';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var l = base32StringToBitList(str);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < l.length; i+= 4) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var get = function(j) { return ((i+j) < l.length) ? l[i+j] : 0; };
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var part = get(0) * 8 + get(1) * 4 + get(2) * 2 + get(3) * 1;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result += baseChars[part];
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return 'f' + result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function integerToHexVarint(i) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // This function takes a JavaScript integer and returns a hexadecimal string representing that integer encoded as a protobuf varint according to the rules explained at
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // https://developers.google.com/protocol-buffers/docs/encoding
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = '';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  if (i < 0) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    throw "Negative integers are supported by Varints but not by this implementation.";
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  } else if (i == 0) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    return '00';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  } else {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    while (i > 0) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      // Get the least significant 7 bits (0..127) of the integer and shift the rest
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      var leastSignificantBits = i & 127;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      i = i >> 7;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      // if this is not the last chunk, set the most significant bit to indicate that the value will be continued in the next byte(s).
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      if (i > 0) { leastSignificantBits |= 128; }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      // Convert to hexadecimal and pad with 0 to get two digits if needed
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      var hex = leastSignificantBits.toString(16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      if (hex.length < 2) { hex = '0' + hex; }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      result += hex;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    return result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function utf8StringToHex(str) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // The input must already be a string for which .charCodeAt() always returns a value <256 (i.e. a string encoded into utf-8 and those values re-encoded into javascript's internal utf-16)
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var s = String(str);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = '';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < s.length; i++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var hex = s.charCodeAt(i).toString(16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    if (hex.length < 2) { hex = '0' + hex; }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result += hex;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function ipfsBlockWithLinks(object) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // object should be an { "Links": links, "Data": hex-encoded string } object
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // Aside from encoding differences, it should match the contents of the "ipfs object get --data-encoding=base64 Qm…hash" command
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  //
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // "Links" should be an array of { 'Hash': cidv1Base16Lowercase, 'Size': Integer } objects.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // This functions returns a hexadecimal string which encodes the ipfs block with the given links.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // This is a partial implementation which is barely sufficient for re-hashing a file, many of the configurable values are hardcoded.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // A Qm…hash can be converted to a "CIDv1 base16 lowercase" hash on the command-line using the following code:
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  //   ipfs cid format -v 1 -b base16 -f='%m' Qm…hash
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  //
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // "File" should be the hex-encoded (base 16, lowercase, no prefix) data, or "false" when the entry is not a DAG leaf
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  //
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // The "Data" field as given by the following command
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  //   ipfs object get --data-encoding=base64 Qm…hash | jq -r '.Data' | base64 -d | xxd -ps
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // is automatically generated using the "File" field if present and the various sizes etc.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var links = object.Links;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var fileHex = object.File;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var result = '';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < links.length; i++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var cid = links[i].Hash;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var size = links[i].Size;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var name = links[i].Name;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var fileHex = object.File;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result += '12';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var encodedLink = ''
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // Some sort of separator or terminator
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedLink += '0a';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // size of the CID (32 bytes + 2 bytes header = 34 bytes = 22 in hex)
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedLink += '22';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    if (cid[0] != 'f' || cid.length != 69) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      if (cid[0] == 'Q' && cid[1] == 'm' && cid.length == 46) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+        cid = 'f' + base58StringToHexString(cid);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+        if (cid[0] != 'f' || cid.length != 69) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+          throw "Internal error";
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+        }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      } else {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+        throw "Expected a lowercase base16 CIDv1 or a Qm…hash in base58 (length 46). The base16 encoding should start with 'f'" +
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+        /*+*/ " and have a length of 32 bytes (64 hexadecimal characters) plus the leading prefix 'f1220' (length of 69 characters in total)" +
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+        /*+*/ " as described in https://github.com/multiformats/multibase. The given hash started with " + cid[0] + " and had a length of " + cid.length;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // Add the CID.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedLink += cid.substring(1);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // Add a second hardcoded part of the encoding.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedLink += '12';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // length of filename
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedLink += integerToHexVarint(name.length);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedLink += utf8StringToHex(name);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedLink += '18';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // Add the size.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedLink += integerToHexVarint(size);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    var encodedLinkSize = encodedLink.length/2
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result += integerToHexVarint(encodedLinkSize);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    result += encodedLink;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // Generate the "Data" field
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var totalSize = (fileHex || '').length / 2;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < object.Links.length; i++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    totalSize += object.Links[i].ContentSize;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var encodedData = '';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  if (object.isFile) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    //             '08'   '02'
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedData += '08' + '02';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // field 12 seems to be optional (for DAG nodes with links (groups of blocks and directories))
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    if (fileHex !== false) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      encodedData += '12';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      encodedData += integerToHexVarint(totalSize);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      encodedData += fileHex;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    //            '18' [8f b0 15 = total size of contents of the file = 35022300]
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedData += '18' + integerToHexVarint(totalSize);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    for (var j = 0; j < object.Links.length; j++) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      // 20 [80 80 10 = size of contents of block 1 = 262144]
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      // 20 [8f b0 05 = size of contents of block 2 = 88079]
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      encodedData += '20';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      encodedData += integerToHexVarint(object.Links[j].ContentSize);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  } else {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    // directory
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    encodedData += '08' + '01';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  // Some sort of separator or terminator
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  result += '0a';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var encodedDataSize = encodedData.length / 2;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  result += integerToHexVarint(encodedDataSize);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  result += encodedData;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return result;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function ipfsHashWithLinks(base, object) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var block = hexStringToIntegerList(ipfsBlockWithLinks(object));
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var hash = sha256IntegerListToMultihash(base, sha256(block));
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  if (base == 16) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    return { "hash" : integerListToLowercaseBase16Multibase(hash), "block" : block };
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  } else {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    return { "hash" : integerListToLowercaseBase32Multibase(hash), "block" : block };
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+// Replace the following string by "XXX_PLACEHOLDER_XXX", then convert the file to hexadecimal
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+// with hexLineWidth nibbles per line, each line formatted without any indentation as
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+// "abcdef00abcdef…" +
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+// except for the last line formatted as
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+// "abcdef00abcdef…";
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+// and the first line which starts immediately after the = sign.
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+var hexLineWidth = 160;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+function formatHexdump(hexLineWidth, src1) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var formattedHexdump = [];
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  var j = 0;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  for (var i = 0; i < src1.length; i+=hexLineWidth) {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    formattedHexdump[j++] = src1.substring(i, i+hexLineWidth);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  return "var src1 = \"" + formattedHexdump.join('" +\n"') + '";';
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+var src2 = src1.replace(utf8StringToHex("var src1 = \"XXX_PLACEHOLDER_XXX\";"), utf8StringToHex(formatHexdump(hexLineWidth, src1)));
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+document.getElementById('self-src').innerText = src2;
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+var index_html = ipfsHashWithLinks(16, {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  "Links": [],
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  "isFile": true,
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  "File": src2
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+}, 16);
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+var root = ipfsHashWithLinks(32, {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  "Links": [
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "Blob.js",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      // f122044923f4a8c0a9b3a170c36894f1eb0890b4cc40ada53867fdbf45dbec8f20695
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmSxKmtcBxBRkmkLGpnXAGrRc16kPrJx5Hmdsvt6LRWeSG",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 21833
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "FileSaver.js",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmUgg2HLo4W9bpf92CkHH6WWVFfg2DmNqJrz2Z46L7VmUq",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 7367
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "JSZip",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmWW2hDPrMU5e5KgSAMiqfM2YW5RSiZzWiNJSQ7w63ngiL",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 422094
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "README",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmPVpTsg2DmVqnCWRVua3vggVAoYLKzZPPgGf5ZQzzVUwf",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 464
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "Viz.js",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmaxUCu1gnFwTTpDoTAPB3fMQQav1NJZrZ7LGqLXECidKj",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 3564410
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "codemirror-5.60.0",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmXPbArMAid8MbC5G7HCyWz2PUkfSMWZaUQpnq63x8Dw2y",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 4669604
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "deploy.sh",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmPqbw9fnWEP8HTCgc1zkJtT16ss4XT4Mg9u6WayA6xMeU",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 1553
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "git-tutorial.css",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmdsWg4RVZR3kRA7xFchoWLEQQzLpzVyspTtKwa9qttDMF",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 10842
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "git-tutorial.js",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmbcAMAuGyFumz4pHtKMnRY2VyRAr2tZoiYBLfNY3p2kCj",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 47083
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "index.html",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": index_html.hash,
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": index_html.block.length
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "pako",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmRtJhu2rJCe59JPS9UiyAja5iUZNmJ8nyBijdZpLLEgG9",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 178431
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    },
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    {
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Name": "sha1.js",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Hash": "QmP7HPPYQqwKXYyDrkDm9vKt8FZE1WsDUJG8cLnjFf4a11",
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+      "Size": 7966
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+    }
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  ],
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+  "Data": "\b\u0001"
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+});
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+document.write('<a href="ipfs://' + root.hash + '"">Permalink to this file: ipfs://'+root.hash+'</a>');
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+</script>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+</body>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();
+</html>
+var sha256 = (function() {
+    // SHA-256 for JavaScript.
+    //
+    // Written in 2014-2016 by Dmitry Chestnykh.
+    // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+    // Unlicense
+    // Public domain, no warranty.
+    //
+    // Function sha256(message) -> hash accepts and returns an Uint8Array
+    var digestLength = 32;
+    var blockSize = 64;
+    // SHA-256 constants
+    var 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
+    ]);
+    var hashBlocks = function(w, v, p, pos, len) {
+        var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+        while (len >= 64) {
+            a = v[0];
+            b = v[1];
+            c = v[2];
+            d = v[3];
+            e = v[4];
+            f = v[5];
+            g = v[6];
+            h = v[7];
+            for (i = 0; i < 16; i++) {
+                j = pos + i * 4;
+                w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+                    ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+            }
+            for (i = 16; i < 64; i++) {
+                u = w[i - 2];
+                t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+                u = w[i - 15];
+                t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+                w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+            }
+            for (i = 0; i < 64; i++) {
+                t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+                    (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+                    ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+                t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+                    (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+                h = g;
+                g = f;
+                f = e;
+                e = (d + t1) | 0;
+                d = c;
+                c = b;
+                b = a;
+                a = (t1 + t2) | 0;
+            }
+            v[0] += a;
+            v[1] += b;
+            v[2] += c;
+            v[3] += d;
+            v[4] += e;
+            v[5] += f;
+            v[6] += g;
+            v[7] += h;
+            pos += 64;
+            len -= 64;
+        }
+        return pos;
+    }
+    // Hash implements SHA256 hash algorithm.
+    var Hash = /** @class */ (function () {
+        function Hash() {
+            this.digestLength = digestLength;
+            this.blockSize = blockSize;
+            // Note: Int32Array is used instead of Uint32Array for performance reasons.
+            this.state = new Int32Array(8); // hash state
+            this.temp = new Int32Array(64); // temporary state
+            this.buffer = new Uint8Array(128); // buffer for data to hash
+            this.bufferLength = 0; // number of bytes in buffer
+            this.bytesHashed = 0; // number of total bytes hashed
+            this.finished = false; // indicates whether the hash was finalized
+            this.reset();
+        }
+        // Resets hash state making it possible
+        // to re-use this instance to hash other data.
+        Hash.prototype.reset = function () {
+            this.state[0] = 0x6a09e667;
+            this.state[1] = 0xbb67ae85;
+            this.state[2] = 0x3c6ef372;
+            this.state[3] = 0xa54ff53a;
+            this.state[4] = 0x510e527f;
+            this.state[5] = 0x9b05688c;
+            this.state[6] = 0x1f83d9ab;
+            this.state[7] = 0x5be0cd19;
+            this.bufferLength = 0;
+            this.bytesHashed = 0;
+            this.finished = false;
+            return this;
+        };
+        // Cleans internal buffers and re-initializes hash state.
+        Hash.prototype.clean = function () {
+            for (var i = 0; i < this.buffer.length; i++) {
+                this.buffer[i] = 0;
+            }
+            for (var i = 0; i < this.temp.length; i++) {
+                this.temp[i] = 0;
+            }
+            this.reset();
+        };
+        // Updates hash state with the given data.
+        //
+        // Optionally, length of the data can be specified to hash
+        // fewer bytes than data.length.
+        //
+        // Throws error when trying to update already finalized hash:
+        // instance must be reset to use it again.
+        Hash.prototype.update = function (data, dataLength) {
+            if (dataLength === void 0) { dataLength = data.length; }
+            if (this.finished) {
+                throw new Error("SHA256: can't update because hash was finished.");
+            }
+            var dataPos = 0;
+            this.bytesHashed += dataLength;
+            if (this.bufferLength > 0) {
+                while (this.bufferLength < 64 && dataLength > 0) {
+                    this.buffer[this.bufferLength++] = data[dataPos++];
+                    dataLength--;
+                }
+                if (this.bufferLength === 64) {
+                    hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+                    this.bufferLength = 0;
+                }
+            }
+            if (dataLength >= 64) {
+                dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+                dataLength %= 64;
+            }
+            while (dataLength > 0) {
+                this.buffer[this.bufferLength++] = data[dataPos++];
+                dataLength--;
+            }
+            return this;
+        };
+        // Finalizes hash state and puts hash into out.
+        //
+        // If hash was already finalized, puts the same value.
+        Hash.prototype.finish = function (out) {
+            if (!this.finished) {
+                var bytesHashed = this.bytesHashed;
+                var left = this.bufferLength;
+                var bitLenHi = (bytesHashed / 0x20000000) | 0;
+                var bitLenLo = bytesHashed << 3;
+                var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+                this.buffer[left] = 0x80;
+                for (var i = left + 1; i < padLength - 8; i++) {
+                    this.buffer[i] = 0;
+                }
+                this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+                this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+                this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+                this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+                this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+                this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+                this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+                this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+                hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+                this.finished = true;
+            }
+            for (var i = 0; i < 8; i++) {
+                out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+                out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+                out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+                out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+            }
+            return this;
+        };
+        // Returns the final hash digest.
+        Hash.prototype.digest = function () {
+            var out = new Uint8Array(this.digestLength);
+            this.finish(out);
+            return out;
+        };
+        return Hash;
+    }());
+    // Returns SHA256 hash of data.
+    var hash = function(data) {
+        var h = (new Hash()).update(data);
+        var digest = h.digest();
+        h.clean();
+        return digest;
+    }
+    return hash;
+})();