-
Notifications
You must be signed in to change notification settings - Fork 445
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
10b9f10
commit afa91d3
Showing
12 changed files
with
174 additions
and
226 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file was deleted.
Oops, something went wrong.
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,128 @@ | ||
# Libp2p Records | ||
|
||
Libp2p nodes need to store data in a public location (e.g. a DHT), or rely on potentially untrustworthy intermediaries to relay information over its lifetime. Accordingly, libp2p nodes need to be able to verify that the data came from a specific peer and that it hasn't been tampered with. | ||
|
||
## Envelope | ||
|
||
Libp2p provides an all-purpose data container called **envelope**. It was created to enable the distribution of verifiable records, which we can prove originated from the addressed peer itself. The envelope includes a signature of the data, so that its authenticity is verified. | ||
|
||
This envelope stores a marshaled record implementing the [interface-record](https://github.com/libp2p/js-libp2p-interfaces/tree/master/src/record). These Records are designed to be serialized to bytes and placed inside of the envelopes before being shared with other peers. | ||
|
||
You can read further about the envelope in [libp2p/specs#217](https://github.com/libp2p/specs/pull/217). | ||
|
||
### Usage | ||
|
||
- create an envelope with an instance of an `interface-record` implementation and prepare it for being exchanged: | ||
|
||
```js | ||
const Envelope = require('libp2p/src/record/envelop') | ||
|
||
// ... create a record named rec with domain X | ||
|
||
const e = await Envelope.seal(rec, peerId) | ||
const wireData = e.marshal() | ||
``` | ||
|
||
- consume a received envelope, as well as to get back the record: | ||
|
||
```js | ||
const Envelope = require('libp2p/src/record/envelop') | ||
// const Record = ... | ||
|
||
// ... receive envelope data | ||
|
||
const domain = 'X' | ||
let e | ||
|
||
try { | ||
e = await Envelope.openAndCertify(data, domain) | ||
} catch (err) {} | ||
|
||
const rec = Record.createFromProtobuf(e.payload) | ||
``` | ||
|
||
## Peer Record | ||
|
||
All libp2p nodes keep a `PeerStore`, that among other information stores a set of known addresses for each peer, which can come from a variety of sources. | ||
|
||
Libp2p peer records were created to enable the distribution of verifiable address records, which we can prove originated from the addressed peer itself. With such guarantees, libp2p can prioritize addresses based on their authenticity, with the most strict strategy being to only dial certified addresses. | ||
|
||
A peer record contains the peers' publicly reachable listen addresses, and may be extended in the future to contain additional metadata relevant to routing. It also contains a `seq` field, so that we can order peer records by time and identify if a received record is more recent than the stored one. | ||
|
||
You can read further about the Peer Record in [libp2p/specs#217](https://github.com/libp2p/specs/pull/217). | ||
|
||
### Usage | ||
|
||
- create a new Peer Record | ||
|
||
```js | ||
const PeerRecord = require('libp2p/src/record/peer-record') | ||
|
||
const pr = new PeerRecord({ | ||
peerId: node.peerId, | ||
multiaddrs: node.multiaddrs | ||
}) | ||
``` | ||
|
||
- create a Peer Record from a protobuf | ||
|
||
```js | ||
const PeerRecord = require('libp2p/src/record/peer-record') | ||
|
||
const pr = PeerRecord.createFromProtobuf(data) | ||
``` | ||
|
||
### Libp2p Flows | ||
|
||
#### Self Record | ||
|
||
Once a libp2p node has started and is listening on a set of multiaddrs, its own peer record can be created. | ||
|
||
The identify service is responsible for creating the self record when the identify protocol kicks in for the first time. This record should be stored for future needs of the identify protocol when connecting with other peers. | ||
|
||
#### Self record Updates | ||
|
||
**_NOT_YET_IMPLEMENTED_** | ||
|
||
While creating peer records is fairly trivial, addresses should not be static and can be modified at arbitrary times. This can happen via an Address Manager API, or even through AutoRelay/AutoNAT. | ||
|
||
When a libp2p node changes its listen addresses, the identify service should be informed. Once that happens, the identify service should create a new self record and store it. With the new record, the identify push/delta protocol will be used to communicate this change to the connected peers. | ||
|
||
#### Subsystem receiving a record | ||
|
||
Considering that a node can discover other peers' addresses from a variety of sources, Libp2p Peerstore should be able to differentiate the addresses that were obtained through a signed peer record. | ||
|
||
Once a record is received and its signature properly validated, its envelope should be stored in the AddressBook on its byte representations. However, the `seq` number of the record must be compared with potentially stored records, so that we do not override correct data. | ||
|
||
The AddressBook Addresses must be updated with the content of the envelope with a certified property that allows other subsystems to identify that the known certified addresses of a peer. | ||
|
||
#### Subsystem providing a record | ||
|
||
Libp2p subsystems that exchange other peers information should provide the envelope that they received by those peers. As a result, other peers can verify if the envelope was really created by the addressed peer. | ||
|
||
When a subsystem wants to provide a record, it should get it from the AddressBook if it exists. Other subsystems should also be able to provide the self record that will also be stored in the AddressBook. | ||
|
||
### Future Work | ||
|
||
- Persistence only considering certified addresses? | ||
- Peers may not know their own addresses. It's often impossible to automatically infer one's own public address, and peers may need to rely on third party peers to inform them of their observed public addresses. | ||
- A peer may inadvertently or maliciously sign an address that they do not control. In other words, a signature isn't a guarantee that a given address is valid. | ||
- Some addresses may be ambiguous. For example, addresses on a private subnet are valid within that subnet but are useless on the public internet. | ||
- Once all these pieces are in place, we will also need a way to prioritize addresses based on their authenticity, that is, the dialer can prioritize self-certified addresses over addresses from an unknown origin. | ||
- Modular dialer? (taken from go PR notes) | ||
- With the modular dialer, users should easily be able to configure precedence. With dialer v1, anything we do to prioritise dials is gonna be spaghetti and adhoc. With the modular dialer, you’d be able to specify the order of dials when instantiating the pipeline. | ||
- Multiple parallel dials. We already have the issue where new addresses aren't added to existing dials. | ||
|
||
### Notes: | ||
|
||
- Possible design for AddressBook | ||
|
||
``` | ||
addr_book_record | ||
\_ peer_id: bytes | ||
\_ signed_addrs: []AddrEntry | ||
\_ unsigned_addrs: []AddrEntry | ||
\_ certified_record | ||
\_ seq: bytes | ||
\_ raw: bytes | ||
``` |
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
File renamed without changes.
Oops, something went wrong.