Struct PeerKey 

#[non_exhaustive]
pub struct PeerKey {
    pub algorithm: PeerKeyAlgorithm,
    pub key: Vec<u8>,
}

A long-lived, client-held public key a session token can be bound to.

Raw bytes plus an algorithm discriminant — deliberately not an ed25519-dalek (or any other crypto crate’s) type. Consumers straddle a real version split (iroh resolves ed25519-dalek 3.0.0-pre, other trust crates resolve 2.2), so a crypto type here would hand every consumer a version pin it cannot satisfy. cheers only ever compares these bytes; it never verifies a signature under them, so it needs no crypto to hold one.

Wire form is {"alg": "<label>", "key": "<base64url-no-pad>"} — the same base64url-no-pad encoding UserDelegation uses, which every cross-platform Ed25519 toolchain agrees on.

Nothing secret lives in this type (a public key is public), so equality is plain ==, not constant-time.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

algorithm: PeerKeyAlgorithm

Which scheme key belongs to.

key: Vec<u8>

The raw public key bytes. Wire form: base64url-no-pad.

Implementations

impl PeerKey

pub fn new( algorithm: PeerKeyAlgorithm, key: impl Into<Vec<u8>>, ) -> Result<Self, PeerKeyError>

Construct + validate: rejects empty bytes, and a length that disagrees with an algorithm that names one (expected_key_len).

pub fn ed25519(key: [u8; 32]) -> Self

The common case — an Ed25519 node public key. Infallible: the length invariant is carried by the array type.

pub fn algorithm(&self) -> &PeerKeyAlgorithm

pub fn as_bytes(&self) -> &[u8]

pub fn to_base64url(&self) -> String

The key’s wire encoding (base64url-no-pad), for logs and roster files.

Trait Implementations

impl Clone for PeerKey

fn clone(&self) -> PeerKey

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PeerKey

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for PeerKey

fn deserialize<D: Deserializer<'de>>(de: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl Eq for PeerKey

impl Hash for PeerKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for PeerKey

fn eq(&self, other: &PeerKey) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for PeerKey

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for PeerKey