arno/bitcoinbook
1
0
Fork 0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2024-11-24 00:51:39 +00:00
Code Issues Releases Wiki Activity

qc2 continued check

Browse Source
This commit is contained in:
Clare Laylock 2023-11-01 12:17:32 -04:00
parent b5a60f1666
commit ecb8837a9a
3 changed files with 16 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
ch03_bitcoin-core.adoc
View File

@ -589,7 +589,7 @@ $ bitcoind -printtoconsole
2023-01-28T03:43:39Z [http] starting 4 worker threads 2023-01-28T03:43:39Z [http] starting 4 worker threads
2023-01-28T03:43:39Z Using wallet directory /lotsofspace/bitcoin/wallets 2023-01-28T03:43:39Z Using wallet directory /lotsofspace/bitcoin/wallets
2023-01-28T03:43:39Z init message: Verifying wallet(s)… 2023-01-28T03:43:39Z init message: Verifying wallet(s)…
2023-01-28T03:43:39Z Using BerkeleyDB version Berkeley DB 4.8.30: (April 9, 2010) 2023-01-28T03:43:39Z Using BerkeleyDB version Berkeley DB 4.8.30
2023-01-28T03:43:39Z Using /16 prefix for IP bucketing 2023-01-28T03:43:39Z Using /16 prefix for IP bucketing
2023-01-28T03:43:39Z init message: Loading P2P addresses… 2023-01-28T03:43:39Z init message: Loading P2P addresses…
2023-01-28T03:43:39Z Loaded 63866 addresses from peers.dat 114ms 2023-01-28T03:43:39Z Loaded 63866 addresses from peers.dat 114ms

14
ch08_signatures.adoc
View File

@ -53,7 +53,12 @@ subset of the data in the transaction, ((("commitment hash")))called the _commit
<<sighash_types>>). The <<sighash_types>>). The
signing key is the user's private key. The result is the signature: signing key is the user's private key. The result is the signature:
latexmath:[\(Sig = F_{sig}(F_{hash}(m), x)\)] [latexmath]
++++
\begin{equation}
\(Sig = F_{sig}(F_{hash}(m), x)\)
\end{equation}
++++
where: where:
@ -867,8 +872,15 @@ coordinate of the nonce _K_.
From there, the algorithm calculates the _s_ value of the signature. Like we did with schnorr signatures, operations involving From there, the algorithm calculates the _s_ value of the signature. Like we did with schnorr signatures, operations involving
integers are modulus p: integers are modulus p:
[latexmath]
++++
\begin{equation}
s = k^-1^ (Hash(m) + x × R)
\end{equation}
++++
_s_ = __k__^-1^ (__Hash__(__m__) + __x__ × __R__) _s_ = __k__^-1^ (__Hash__(__m__) + __x__ × __R__)
where: where:
* _k_ is the private nonce * _k_ is the private nonce

2
ch10_network.adoc
View File

@ -1143,6 +1143,8 @@ lightweight client to download an 80-byte block header, a (usually)
small coinbase transaction, and the filter for that block to receive small coinbase transaction, and the filter for that block to receive
strong evidence that the filter ((("Bitcoin network", "compact block filters", startref="bitcoin-network-compact-filter")))((("compact block filters", startref="compact-block-filter")))((("blocks", "compact block filters", startref="block-compact-filter")))was accurate. strong evidence that the filter ((("Bitcoin network", "compact block filters", startref="bitcoin-network-compact-filter")))((("compact block filters", startref="compact-block-filter")))((("blocks", "compact block filters", startref="block-compact-filter")))was accurate.
[role="less_space pagebreak-before"]
=== Lightweight Clients and Privacy === Lightweight Clients and Privacy
Lightweight clients ((("Bitcoin network", "lightweight clients", "privacy")))((("lightweight clients", "privacy")))((("privacy", "lightweight clients")))have weaker privacy than a full node. A full Lightweight clients ((("Bitcoin network", "lightweight clients", "privacy")))((("lightweight clients", "privacy")))((("privacy", "lightweight clients")))have weaker privacy than a full node. A full