// Copyright 2018 Parity Technologies (UK) Ltd. // // Permission is hereby granted, free of charge, to any person obtaining a // copy of this software and associated documentation files (the "Software"), // to deal in the Software without restriction, including without limitation // the rights to use, copy, modify, merge, publish, distribute, sublicense, // and/or sell copies of the Software, and to permit persons to whom the // Software is furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER // DEALINGS IN THE SOFTWARE. use crate::PublicKey; use bs58; use quick_error::quick_error; use multihash; use std::{convert::TryFrom, fmt, str::FromStr}; /// Public keys with byte-lengths smaller than `MAX_INLINE_KEY_LENGTH` will be /// automatically used as the peer id using an identity multihash. // // Note: see `from_public_key` for how this value will be used in the future. const MAX_INLINE_KEY_LENGTH: usize = 42; /// Identifier of a peer of the network. /// /// The data is a multihash of the public key of the peer. // TODO: maybe keep things in decoded version? #[derive(Clone, PartialEq, Eq, Hash)] pub struct PeerId { multihash: multihash::Multihash, } impl fmt::Debug for PeerId { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { f.debug_tuple("PeerId") .field(&self.to_base58()) .finish() } } impl fmt::Display for PeerId { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { self.to_base58().fmt(f) } } impl PeerId { /// Builds a `PeerId` from a public key. #[inline] pub fn from_public_key(key: PublicKey) -> PeerId { let key_enc = key.into_protobuf_encoding(); // Note: the correct behaviour, according to the libp2p specifications, is the // commented-out code, which consists it transmitting small keys un-hashed. However, this // version and all previous versions of rust-libp2p always hash the key. Starting from // version 0.13, rust-libp2p accepts both hashed and non-hashed keys as input // (see `from_bytes`). Starting from version 0.14, rust-libp2p will switch to not hashing // the key (a.k.a. the correct behaviour). // In other words, rust-libp2p 0.13 is compatible with all versions of rust-libp2p. // Rust-libp2p 0.12 and below is **NOT** compatible with rust-libp2p 0.14 and above. /*let hash_algorithm = if key_enc.len() <= MAX_INLINE_KEY_LENGTH { multihash::Hash::Identity } else { multihash::Hash::SHA2256 };*/ let hash_algorithm = multihash::Hash::SHA2256; let multihash = multihash::encode(hash_algorithm, &key_enc) .expect("identity and sha2-256 are always supported by known public key types"); PeerId { multihash } } /// Checks whether `data` is a valid `PeerId`. If so, returns the `PeerId`. If not, returns /// back the data as an error. #[inline] pub fn from_bytes(data: Vec) -> Result> { match multihash::Multihash::from_bytes(data) { Ok(multihash) => { if multihash.algorithm() == multihash::Hash::SHA2256 || multihash.algorithm() == multihash::Hash::Identity { Ok(PeerId { multihash }) } else { Err(multihash.into_bytes()) } } Err(err) => Err(err.data), } } /// Turns a `Multihash` into a `PeerId`. If the multihash doesn't use the correct algorithm, /// returns back the data as an error. #[inline] pub fn from_multihash(data: multihash::Multihash) -> Result { if data.algorithm() == multihash::Hash::SHA2256 || data.algorithm() == multihash::Hash::Identity { Ok(PeerId { multihash: data }) } else { Err(data) } } /// Generates a random peer ID from a cryptographically secure PRNG. /// /// This is useful for randomly walking on a DHT, or for testing purposes. #[inline] pub fn random() -> PeerId { PeerId { multihash: multihash::Multihash::random(multihash::Hash::SHA2256) } } /// Returns a raw bytes representation of this `PeerId`. /// /// Note that this is not the same as the public key of the peer. #[inline] pub fn into_bytes(self) -> Vec { self.multihash.into_bytes() } /// Returns a raw bytes representation of this `PeerId`. /// /// Note that this is not the same as the public key of the peer. #[inline] pub fn as_bytes(&self) -> &[u8] { self.multihash.as_bytes() } /// Returns a base-58 encoded string of this `PeerId`. #[inline] pub fn to_base58(&self) -> String { bs58::encode(self.multihash.as_bytes()).into_string() } /// Returns the raw bytes of the hash of this `PeerId`. #[inline] pub fn digest(&self) -> &[u8] { self.multihash.digest() } /// Checks whether the public key passed as parameter matches the public key of this `PeerId`. /// /// Returns `None` if this `PeerId`s hash algorithm is not supported when encoding the /// given public key, otherwise `Some` boolean as the result of an equality check. pub fn is_public_key(&self, public_key: &PublicKey) -> Option { let alg = self.multihash.algorithm(); let enc = public_key.clone().into_protobuf_encoding(); match multihash::encode(alg, &enc) { Ok(h) => Some(h == self.multihash), Err(multihash::EncodeError::UnsupportedType) => None, Err(multihash::EncodeError::UnsupportedInputLength) => None, } } } impl From for PeerId { #[inline] fn from(key: PublicKey) -> PeerId { PeerId::from_public_key(key) } } impl TryFrom> for PeerId { type Error = Vec; fn try_from(value: Vec) -> Result { PeerId::from_bytes(value) } } impl TryFrom for PeerId { type Error = multihash::Multihash; fn try_from(value: multihash::Multihash) -> Result { PeerId::from_multihash(value) } } impl PartialEq for PeerId { #[inline] fn eq(&self, other: &multihash::Multihash) -> bool { &self.multihash == other } } impl PartialEq for multihash::Multihash { #[inline] fn eq(&self, other: &PeerId) -> bool { self == &other.multihash } } impl AsRef for PeerId { #[inline] fn as_ref(&self) -> &multihash::Multihash { &self.multihash } } impl AsRef<[u8]> for PeerId { #[inline] fn as_ref(&self) -> &[u8] { self.as_bytes() } } impl Into for PeerId { #[inline] fn into(self) -> multihash::Multihash { self.multihash } } quick_error! { #[derive(Debug)] pub enum ParseError { B58(e: bs58::decode::Error) { display("base-58 decode error: {}", e) cause(e) from() } MultiHash { display("decoding multihash failed") } } } impl FromStr for PeerId { type Err = ParseError; #[inline] fn from_str(s: &str) -> Result { let bytes = bs58::decode(s).into_vec()?; PeerId::from_bytes(bytes).map_err(|_| ParseError::MultiHash) } } #[cfg(test)] mod tests { use crate::{PeerId, identity}; #[test] fn peer_id_is_public_key() { let key = identity::Keypair::generate_ed25519().public(); let peer_id = key.clone().into_peer_id(); assert_eq!(peer_id.is_public_key(&key), Some(true)); } #[test] fn peer_id_into_bytes_then_from_bytes() { let peer_id = identity::Keypair::generate_ed25519().public().into_peer_id(); let second = PeerId::from_bytes(peer_id.clone().into_bytes()).unwrap(); assert_eq!(peer_id, second); } #[test] fn peer_id_to_base58_then_back() { let peer_id = identity::Keypair::generate_ed25519().public().into_peer_id(); let second: PeerId = peer_id.to_base58().parse().unwrap(); assert_eq!(peer_id, second); } #[test] fn random_peer_id_is_valid() { for _ in 0 .. 5000 { let peer_id = PeerId::random(); assert_eq!(peer_id, PeerId::from_bytes(peer_id.clone().into_bytes()).unwrap()); } } }