Archives/lnbook
2
0
Fork 0
mirror of https://github.com/lnbook/lnbook synced 2024-11-18 21:28:03 +00:00
Code Issues Projects Releases Wiki Activity

Edited 16_security_privacy_ln.asciidoc with Atlas code editor

Browse Source
This commit is contained in:
kristen@oreilly.com 2021-10-18 18:22:47 -07:00
parent 4c54529d4f
commit dab3b10a0b
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
16_security_privacy_ln.asciidoc
View File

@ -241,7 +241,7 @@ Note that in any case, Mallory's estimation becomes twice as precise after just
She can continue probing, choosing the next probing amount such that it divides the current estimation interval in half. She can continue probing, choosing the next probing amount such that it divides the current estimation interval in half.
This well-known search technique is called _binary search_. This well-known search technique is called _binary search_.
With binary search, the number of probes is _logarithmic_ in the desired precision. With binary search, the number of probes is _logarithmic_ in the desired precision.
For example, to obtain Alice's balance in a channel of 1 million satoshis up to a single satoshi, Mallory would only have to perform log~2~(1,000,000) ≈ 20 probings. For example, to obtain Alice's balance in a channel of 1 million satoshis up to a single satoshi, Mallory would only have to perform log~2~ (1,000,000) ≈ 20 probings.
If one probing takes 3 seconds, one channel can be precisely probed in only about a minute! If one probing takes 3 seconds, one channel can be precisely probed in only about a minute!
Channel probing can be made even more efficient. Channel probing can be made even more efficient.