mirror of
https://github.com/fluencelabs/rust-libp2p
synced 2025-05-25 08:51:20 +00:00
* Implement Debug for (ed25519|secp256k1)::(Keypair|SecretKey) (#1285) * Fix possible arithmetic overflow in libp2p-kad. (#1291) When the number of active queries exceeds the (internal) JOBS_MAX_QUERIES limit, which is only supposed to bound the number of concurrent queries relating to background jobs, an arithmetic overflow occurs. This is fixed by using saturating subtraction. * protocols/plaintext: Add example on how to upgrade with PlainTextConfig1 (#1286) * [mdns] - Support for long mDNS names (Bug #1232) (#1287) * Dead code -- commenting out with a note referencing future implementation * Adding "std" feature so that cargo can build in other directories (notably `misc/mdns`, so that I could run these tests) * Permitting `PeerID` to be built from an `Identity` multihash * The length limit for DNS labels is 63 characters, as per RFC1035 * Allocates the vector with capacity for the service name plus additional QNAME encoding bytes * Added support for encoding/decoding peer IDs with an encoded length greater than 63 characters * Removing "std" from ring features Co-Authored-By: Pierre Krieger <pierre.krieger1708@gmail.com> * Retaining MAX_INLINE_KEY_LENGTH with comment about future usage * `segment_peer_id` consumes `peer_id` ... plus an early return for IDs that don't need to be segmented * Fixing logic * Bump most dependencies (#1268) * Bump most dependencies This actually builds 😊. * Bump all dependencies Includes the excellent work of @rschulman in #1265. * Remove use of ed25519-dalek fork * Monomorphize more dependencies * Add compatibility hack for rand Cargo allows a crate to depend on multiple versions of another, but `cargo-web` panics in that situation. Use a wrapper crate to work around the panic. * Use @tomaka’s idea for using a newer `rand` instead of my own ugly hack. * Switch to Parity master as its dependency-bumping PR has been merged. * Update some depenendencies again * Remove unwraps and `#[allow(deprecated)]`. * Remove spurious changes to dependencies Bumping minor or patch versions is not needed, and increases likelyhood of merge conflicts. * Remove some redundant Cargo.toml changes * Replace a retry loop with an expect `ed25519::SecretKey::from_bytes` will never fail for 32-byte inputs. * Revert changes that don’t belong in this PR * Remove using void to bypass ICE (#1295) * Publish 0.13.0 (#1294)
278 lines
8.9 KiB
Rust
278 lines
8.9 KiB
Rust
// 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<u8>) -> Result<PeerId, Vec<u8>> {
|
|
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<PeerId, multihash::Multihash> {
|
|
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<u8> {
|
|
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<bool> {
|
|
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<PublicKey> for PeerId {
|
|
#[inline]
|
|
fn from(key: PublicKey) -> PeerId {
|
|
PeerId::from_public_key(key)
|
|
}
|
|
}
|
|
|
|
impl TryFrom<Vec<u8>> for PeerId {
|
|
type Error = Vec<u8>;
|
|
|
|
fn try_from(value: Vec<u8>) -> Result<Self, Self::Error> {
|
|
PeerId::from_bytes(value)
|
|
}
|
|
}
|
|
|
|
impl TryFrom<multihash::Multihash> for PeerId {
|
|
type Error = multihash::Multihash;
|
|
|
|
fn try_from(value: multihash::Multihash) -> Result<Self, Self::Error> {
|
|
PeerId::from_multihash(value)
|
|
}
|
|
}
|
|
|
|
impl PartialEq<multihash::Multihash> for PeerId {
|
|
#[inline]
|
|
fn eq(&self, other: &multihash::Multihash) -> bool {
|
|
&self.multihash == other
|
|
}
|
|
}
|
|
|
|
impl PartialEq<PeerId> for multihash::Multihash {
|
|
#[inline]
|
|
fn eq(&self, other: &PeerId) -> bool {
|
|
self == &other.multihash
|
|
}
|
|
}
|
|
|
|
impl AsRef<multihash::Multihash> 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<multihash::Multihash> 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<Self, Self::Err> {
|
|
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());
|
|
}
|
|
}
|
|
}
|