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.

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

Performance tuning: #112

Merged
merged 2 commits into from
Sep 6, 2022
Merged

Performance tuning: #112

merged 2 commits into from
Sep 6, 2022

Conversation

Fotoratte
Copy link
Contributor

I tuned the performance a little bit. In the original it calculates all the hashes for each line in each file.
Therefore calculating the same hash over and over again.

I collect the searched hashes first, excluding duplicate entries. Then I calculate the hashes once and check if there is a match.

Also I extended the number-range from 7 to 10, because german numbers are longer

Rex added 2 commits September 6, 2022 19:07
First make a list of target hashes excluding duplicates
Calculate hashes and compare with all target hashes
@abrignoni
Copy link
Owner

Thank you so much for this improvement. Much appreciated.

@abrignoni abrignoni merged commit 2f3b40d into abrignoni:main Sep 6, 2022
@Fotoratte
Copy link
Contributor Author

Woah, that was a pretty fast merge :D
I was thinking about caching, but this would become pretty big. I made a rainbow-table as a PoC and it was 70gigs.

But I will probably re-write it with a generator. Next pull request incoming ;-)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants