1
0
Fork 0
mirror of https://git.sr.ht/~seirdy/seirdy.one synced 2024-11-27 14:12:09 +00:00

Fix major typo (wrong sign, + -> -)

This commit is contained in:
Rohan Kumar 2021-01-12 23:16:36 -08:00
parent 069bedbb7b
commit eb1a03f4be
No known key found for this signature in database
GPG key ID: 1E892DB2A5F84479
2 changed files with 2 additions and 2 deletions

View file

@ -70,7 +70,7 @@ A more involved approach to picking a good value might utilize the Plank-Einstei
=> https://en.wikipedia.org/wiki/Planck%E2%80%93Einstein_relation Plank-Einstein relation (Wikipedia)
It's also probably a better idea to make this value an estimate for flipping a single bit, and to estimate the average number of bit-flips it takes to make a single password guess. If that bothers you, pick a number b you believe to be a good estimate for a bit-flip-count and calculate P(n+b, e) instead of P(n, e).
It's also probably a better idea to make this value an estimate for flipping a single bit, and to estimate the average number of bit-flips it takes to make a single password guess. If that bothers you, pick a number b you believe to be a good estimate for a bit-flip-count and calculate P(n-b, e) instead of P(n, e).
What's the temperature of the system? Three pieces of information help us find out:

View file

@ -124,7 +124,7 @@ relation](https://en.wikipedia.org/wiki/Planck%E2%80%93Einstein_relation).
It's also probably a better idea to make this value an estimate for flipping a single
bit, and to estimate the average number of bit-flips it takes to make a single
password guess. If that bothers you, pick a number `b` you believe to be a good
estimate for a bit-flip-count and calculate `P(n+b, e)` instead of `P(n, e)`.
estimate for a bit-flip-count and calculate `P(n-b, e)` instead of `P(n, e)`.
What's the temperature of the system? Three pieces of information help us find out: