fmaury/seirdy.one
1
0
Fork 0
mirror of https://git.sr.ht/~seirdy/seirdy.one synced 2024-11-10 00:12:09 +00:00
Code Issues Projects Releases Wiki Activity

Add link to Bremermann's limit

Browse source 
Found via goldenkey on Hacker News.
This commit is contained in:
Rohan Kumar 2021-01-12 18:13:45 -08:00
parent 831443c52c
commit b60b478281
No known key found for this signature in database
GPG key ID: 1E892DB2A5F84479
2 changed files with 11 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
content/posts/password-strength.gmi
View file

@ -224,6 +224,9 @@ He uses an alternative approach to finding the maximum bits we can work with: he
This model takes into account more than just the mass of the observable universe. While we previously found that the MOAC can brute-force a password with 306.76 entropy bits, this model allows the same for up to 405.3 bits.
Another well-known approach to calculating physical limits of computation is Bremermann's limit, which calculates the speed of computation given a finite amount of mass. This article's approach disregards time, focusing only on mass-energy equivalence.
=> https://en.wikipedia.org/wiki/Bremermann%27s_limit Bremermann's limit (Wikipedia)
## Acknowledgements

12
content/posts/password-strength.md
View file

@ -283,15 +283,19 @@ Further reading: an alternative approach
----------------------------------------
Check out Scott Aaronson's article, [Cosmology and
Complexity](https://www.scottaaronson.com/democritus/lec20.html).
He uses an alternative approach to finding the maximum bits we can work with: he
simply inverts the [cosmological
constant](https://en.wikipedia.org/wiki/Cosmological_constant).
Complexity](https://www.scottaaronson.com/democritus/lec20.html). He uses an
alternative approach to finding the maximum bits we can work with: he simply inverts
the [cosmological constant](https://en.wikipedia.org/wiki/Cosmological_constant).
This model takes into account more than just the mass of the observable universe.
While we previously found that the MOAC can brute-force a password with 306.76
entropy bits, this model allows the same for up to 405.3 bits.
Another well-known approach to calculating physical limits of computation is
[Bremermann's limit](https://en.wikipedia.org/wiki/Bremermann%27s_limit), which
calculates the speed of computation given a finite amount of mass. This article's
approach disregards time, focusing only on mass-energy equivalence.
Acknowledgements
----------------