Post by AnthroHeart on Jun 21, 2021 7:28:45 GMT
I found a hashing utility that allows arbitrary length, called KangarooTwelve.
I must say that's a freaking cool name.
If you're curious, here's the gitHub that I forked: github.com/tsweet77/kangarootwelve_xkcp.rs
I downloaded it from here: github.com/oconnor663/kangarootwelve_xkcp.rs/releases
What you do is pass a file to it, and it will give you a HASH value.
There is a famous HASH Function called SHA-256, that is 256-bits.
With KangarooTwelve, we can do 2048-bits, and more.
When you hit 2048 bits, you are beyond the number of quantum states in the Universe,
so this guarantees uniqueness.
So, what I did (in Linux):
This will write INTENTIONS.TXT into the file HASH0.TXT 1 Million Times:
1) for n in {1..1000000}; do echo "INTENTIONS.TXT" >> HASH0.TXT; done
This gives us the KangarooTwelve Hash, using 256 Bytes (or 2048 bits):
2) k12sum_linux_x64_bin --length 256 HASH0.TXT
74287f3803fde5fb1e8cdcd6fc3af401df64aa83fb6382752f33e56bfd5bbfb98bf880403e4324e3c0192346524c6bdfab00860e8ccfe9fca3d361d6a8718203e13ba220bc4333c86dcdb9d6d870648041bfc38160c0e4e08d0f581ab89d5230a3c514832148445a180f531c05a8784506de94ae9edd1cd1a8f8fca30514c11aa8c61714be93233b7432f7b82d3e66fb189196e315b06758a2ed53745d23b4cd5b7472740d327003656e03c2e7dd33649ab082d9079d29e7d96b318d3154aa2baea125ce886e70d6594f0ed836f9bd957b8f8f619bb4eb5ef6b0a061e932d9253d38d6a6e4cbcd6f35c26d4db2a2e8b97e9a7090ffb3e8cbb466e9e4e8a27f57 HASH0.TXT
It only takes a split second to get the KangarooTwelve Hash of a HASH0.TXT, which has INTENTIONS.TXT repeated a million times.
So, if you're creating your Nesting Files, and want to do Nested Hashing, you can repeat steps 1 - 2.
So HASH1.TXT would have 1 Million instances of:
74287f3803fde5fb1e8cdcd6fc3af401df64aa83fb6382752f33e56bfd5bbfb98bf880403e4324e3c0192346524c6bdfab00860e8ccfe9fca3d361d6a8718203e13ba220bc4333c86dcdb9d6d870648041bfc38160c0e4e08d0f581ab89d5230a3c514832148445a180f531c05a8784506de94ae9edd1cd1a8f8fca30514c11aa8c61714be93233b7432f7b82d3e66fb189196e315b06758a2ed53745d23b4cd5b7472740d327003656e03c2e7dd33649ab082d9079d29e7d96b318d3154aa2baea125ce886e70d6594f0ed836f9bd957b8f8f619bb4eb5ef6b0a061e932d9253d38d6a6e4cbcd6f35c26d4db2a2e8b97e9a7090ffb3e8cbb466e9e4e8a27f57
I must say that's a freaking cool name.
If you're curious, here's the gitHub that I forked: github.com/tsweet77/kangarootwelve_xkcp.rs
I downloaded it from here: github.com/oconnor663/kangarootwelve_xkcp.rs/releases
What you do is pass a file to it, and it will give you a HASH value.
There is a famous HASH Function called SHA-256, that is 256-bits.
With KangarooTwelve, we can do 2048-bits, and more.
When you hit 2048 bits, you are beyond the number of quantum states in the Universe,
so this guarantees uniqueness.
So, what I did (in Linux):
This will write INTENTIONS.TXT into the file HASH0.TXT 1 Million Times:
1) for n in {1..1000000}; do echo "INTENTIONS.TXT" >> HASH0.TXT; done
This gives us the KangarooTwelve Hash, using 256 Bytes (or 2048 bits):
2) k12sum_linux_x64_bin --length 256 HASH0.TXT
74287f3803fde5fb1e8cdcd6fc3af401df64aa83fb6382752f33e56bfd5bbfb98bf880403e4324e3c0192346524c6bdfab00860e8ccfe9fca3d361d6a8718203e13ba220bc4333c86dcdb9d6d870648041bfc38160c0e4e08d0f581ab89d5230a3c514832148445a180f531c05a8784506de94ae9edd1cd1a8f8fca30514c11aa8c61714be93233b7432f7b82d3e66fb189196e315b06758a2ed53745d23b4cd5b7472740d327003656e03c2e7dd33649ab082d9079d29e7d96b318d3154aa2baea125ce886e70d6594f0ed836f9bd957b8f8f619bb4eb5ef6b0a061e932d9253d38d6a6e4cbcd6f35c26d4db2a2e8b97e9a7090ffb3e8cbb466e9e4e8a27f57 HASH0.TXT
It only takes a split second to get the KangarooTwelve Hash of a HASH0.TXT, which has INTENTIONS.TXT repeated a million times.
So, if you're creating your Nesting Files, and want to do Nested Hashing, you can repeat steps 1 - 2.
So HASH1.TXT would have 1 Million instances of:
74287f3803fde5fb1e8cdcd6fc3af401df64aa83fb6382752f33e56bfd5bbfb98bf880403e4324e3c0192346524c6bdfab00860e8ccfe9fca3d361d6a8718203e13ba220bc4333c86dcdb9d6d870648041bfc38160c0e4e08d0f581ab89d5230a3c514832148445a180f531c05a8784506de94ae9edd1cd1a8f8fca30514c11aa8c61714be93233b7432f7b82d3e66fb189196e315b06758a2ed53745d23b4cd5b7472740d327003656e03c2e7dd33649ab082d9079d29e7d96b318d3154aa2baea125ce886e70d6594f0ed836f9bd957b8f8f619bb4eb5ef6b0a061e932d9253d38d6a6e4cbcd6f35c26d4db2a2e8b97e9a7090ffb3e8cbb466e9e4e8a27f57
