mirrors/lightning-bolts
1
0
Fork 0
mirror of https://github.com/lightning/bolts.git synced 2025-03-09 23:55:17 +01:00
Code Issues Projects Releases Wiki Activity

Fix typos (#1130)

Browse source 
* BOLT 04: fix typos
* proposals: fix typos
This commit is contained in:
xiaolou86 2024-01-30 13:54:54 +08:00 • committed by GitHub
parent a4b6357bad
commit 9f55ccdfee
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
2 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
04-onion-routing.md
View file

@ -812,7 +812,7 @@ func NewOnionPacket(paymentPath []*btcec.PublicKey, sessionKey *btcec.PrivateKey
var nextHmac [hmacSize]byte
// Our starting packet needs to be filled out with random bytes, we
// generate some determinstically using the session private key.
// generate some deterministically using the session private key.
paddingKey := generateKey("pad", sessionKey.Serialize()
paddingBytes := generateCipherStream(paddingKey, routingInfoSize)
copy(mixHeader[:], paddingBytes)
@ -1500,7 +1500,7 @@ The writer:
- MUST set the `onion_message_packet` `version` to 0.
- MUST construct the `onion_message_packet` `onionmsg_payloads` as detailed above using Sphinx.
- MUST NOT use any `associated_data` in the Sphinx construcion.
- MUST NOT use any `associated_data` in the Sphinx construction.
- SHOULD set `onion_message_packet` `len` to 1366 or 32834.
- SHOULD retry via a different path if it expects a response and doesn't receive one after a reasonable period.
- For the non-final nodes' `onionmsg_tlv`:

4
proposals/route-blinding.md
View file

@ -247,7 +247,7 @@ channels described above and adds a safety margin in case nodes update their rel
Alice uses the same values for both channels for simplicity's sake. Alice can now compute aggregate
values for the complete route (iteratively starting from the end of the route), using integer
arithmetric to compute `ceil(a/b)` as `(a+b-1)/b` (we round values up, otherwise the sender may
arithmetic to compute `ceil(a/b)` as `(a+b-1)/b` (we round values up, otherwise the sender may
receive slightly less than intended):
* `route_fee_base_msat(n+1) = (fee_base_msat(n+1) * 1000000 + route_fee_base_msat(n) * (1000000 + fee_proportional_millionths(n+1)) + 1000000 - 1) / 1000000`
@ -459,7 +459,7 @@ periodically refresh them.
### Recipient pays fees
It may be unfair to make payers pay more fees to accomodate the recipient's wish for anonymity.
It may be unfair to make payers pay more fees to accommodate the recipient's wish for anonymity.
It should instead be the recipient that pays the fees of the blinded hops (and the payer pays the
fees to reach the introduction point).