summaryrefslogtreecommitdiff
path: root/bip-0350.mediawiki
diff options
context:
space:
mode:
authorcocoyeal <ricodigging@gmail.com>2024-05-29 16:18:11 +0800
committercocoyeal <ricodigging@gmail.com>2024-05-29 16:18:11 +0800
commit46a2440718ce96681155e4c96bfc373d079d2eef (patch)
treeb49a43a013d085727b1ffe38f7a83031ac4f45c0 /bip-0350.mediawiki
parent758a58ab54fddce0c6d062ed8fdf2b28c2eb7790 (diff)
downloadbips-46a2440718ce96681155e4c96bfc373d079d2eef.tar.xz
remove duplicated words
Diffstat (limited to 'bip-0350.mediawiki')
-rw-r--r--bip-0350.mediawiki2
1 files changed, 1 insertions, 1 deletions
diff --git a/bip-0350.mediawiki b/bip-0350.mediawiki
index 439b2a2..4c30b8f 100644
--- a/bip-0350.mediawiki
+++ b/bip-0350.mediawiki
@@ -217,7 +217,7 @@ their invalidity.
Checksums are used to detect errors introduced into data during transfer. A hash function-based checksum such as Base58Check detects any type of error uniformly, but not all classes of errors are equally likely to occur in practice. Bech32 prioritizes detection of substitution errors, but improving detection of one error class inevitably worsens detection of other error classes. During the design of Bech32, it was assumed that other simple error patterns beside substitutions would have a similar detection rate as in a hash function-based design, and detection would only be worse for complex, impractical errors. The discovered insertion weakness shows that this is not the case.
-For Bech32m, we aim to retain Bech32's guarantees for substitution errors, but make sure that other common errors don't perform worse than a hash function-based checksum would. To make sure the new standard is easy to implement, we restrict the design space to only amending the final constant that is xored in, as it was [https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2019-December/017521.html observed] that that is sufficient to mitigate the 'q' insertion issue while retaining the intended substitution error detection. In what follows, we explain how the new constant ''0x2bc830a3'' was chosen.
+For Bech32m, we aim to retain Bech32's guarantees for substitution errors, but make sure that other common errors don't perform worse than a hash function-based checksum would. To make sure the new standard is easy to implement, we restrict the design space to only amending the final constant that is xored in, as it was [https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2019-December/017521.html observed] that is sufficient to mitigate the 'q' insertion issue while retaining the intended substitution error detection. In what follows, we explain how the new constant ''0x2bc830a3'' was chosen.
===Error patterns & detection probability===