summaryrefslogtreecommitdiffstats
path: root/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'README.md')
-rw-r--r--README.md8
1 files changed, 4 insertions, 4 deletions
diff --git a/README.md b/README.md
index f99654a..7e3fbc7 100644
--- a/README.md
+++ b/README.md
@@ -12,17 +12,17 @@ You know the length of the file is 3 bytes
You know the hash (in this example I'll use sha256) is `ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad`
-Finally, for the unique data groups, I'll use the example of group of {1} and find the total number of binary 1's in the data. I believe this would be the most difficult to regenerate.
+Finally, for the unique data groups, I'll use the example group of {1} and find the total number of binary 1s in the data. I believe this would be the most difficult to regenerate.
To do this we take our data "abc"
which in binary would be `01100001 01100010 01100011`
-So there will be 10 uinique groups of {1}
+So there will be 10 unique groups of {1}
-Now we generate possible combinations untilt the hash of it is correct and we have our data! :D
+Now we generate possible combinations until the hash of it is correct and we have our data! :D
-So the the total number of possible combinations would be 24 choose 10 which == 1961256 combinations. Out of the total combinations of 2^24 == 16777216 the 1961256 brings the number of hashes to try to only 11.69% of all possible.
+So the total number of possible combinations would be 24 choose 10 which == 1961256 combinations. Out of the total combinations of 2^24 == 16777216 the 1961256 brings the number of hashes to try to only 11.69% of all possible.
![LaTex Image](http://mathurl.com/ycgnob6r.png "quick mafs")