Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add probability equation to README #112

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Add probability equation to README #112

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b996614
Add probability equation to README
Zipdox2 Nov 6, 2024
dcad68d
Fix spelling in README
Zipdox2 Nov 7, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 12 additions & 4 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -87,10 +87,18 @@ performance-related tips.

* How long is it going to take?

Because of probablistic nature of brute force key generation, and
varience of hardware it's going to run on, it's hard to make promisses
about how long it's going to take, especially when the most of users
want just a few keys.\
Because of the probablistic nature of brute force key generation, and
varience of hardware it's going to run on, it's hard to make promises
about how long it's going to take, especially when most users want
just a few keys.

The probabilty can be calculated with this equation:\
$T={32^N \over H}$\
where:\
*T* is the average time to a match.\
*N* is the length of the filter.\
*H* is the number of calculations per second.

See [this issue][#27] for very valuable discussion about this.\
If your machine is powerful enough, 6 character prefix shouldn't take
more than few tens of minutes, if using batch mode (read
Expand Down