mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix typo

Browse Source
This commit is contained in:
Volker Diels-Grabsch authored and GitHub committed 2022-01-17 23:41:44 +01:00
1 parent 989515ca7a
commit 33548fde29
1 file changed
+1 -1
Download Patch File Download Diff File Expand all files Collapse all files
2019/diels-grabsch2/hint.text
+1 -1
View File
@@ -96,7 +96,7 @@ precomputation, the 8 initial hash values are not needed, but the
It is almost impossible to hide those 640 bytes in the source. It is almost impossible to hide those 640 bytes in the source.
Luckily, the round constants where not chosen by fair dice rolls. Luckily, the round constants where not chosen by fair dice rolls.
They are the fractional parts of certain irrational numbers, namely, They are the fractional parts of certain irrational numbers, namely,
the cube roots of the first 80 primes. So the round constrants are the cube roots of the first 80 primes. So the round constants are
calculated at runtime, which makes the program shorter and adds calculated at runtime, which makes the program shorter and adds
another layer of obfuscation. another layer of obfuscation.