Struct Address 

pub struct Address { /* private fields */ }

A self-certifying protocol address: off1….

Ordering

Ord compares the underlying hash bytes, not the rendered string. The two orders differ: the bech32 charset (qpzry9x8gf2tvdw0s3jn54khce6mua7l) is not monotonic in ASCII — value 4 renders as y (0x79) and value 5 as 9 (0x39) — and a string comparison would also weigh the checksum characters.

Which order a tiebreaker uses is fixed per site, and the sites disagree. Both-create session ownership compares Address values (hash bytes); group leave election, admin auto-promotion and fork leader election sort rendered strings. Each converges on its own, because every peer running that tiebreaker sorts the same way.

Do not “harmonize” one site onto the other order. Peers that changed and peers that did not would then elect different winners from identical input, with no way to detect the disagreement locally. Prefer hash-byte order for anything new. See docs/adr/0003-self-certifying-addresses.md.

Implementations

impl Address

pub const HRP_STR: &'static str = "off"

Human-readable part carried by every address.

pub const VERSION: u8 = 0x01

The only address version this build understands.

pub const HASH_LEN: usize = 20

Length of the truncated identity-key hash, in bytes.

160 bits, which is a second-preimage margin of ~2^160 and a collision margin of ~2^80 — the birthday bound on the same truncation. Both are stated here because they buy different things and only the first is what the impersonation claim rests on:

• ~2^160 is the cost of aiming at an address that already exists: producing a key that derives to someone else’s address. That is the attack the sender-derivation gate replaced the trust-pin store to stop, and it is the figure the guides and changelog quote.
• ~2^80 is the cost of producing two identity keys that share one address, neither fixed in advance. It impersonates nobody, but it does let a single entity hold two signing keys that are indistinguishable at the address layer — enough to equivocate, and enough to defeat the “one identity cannot hold two leaves” property that the MLS leaf binding otherwise inherits from MLS signature-key uniqueness.

~2^80 is below the ~2^128 a greenfield design would target, and is a deliberate trade rather than an oversight: every mesh frame carries a sender and a recipient address, and BLE budget is the binding constraint. Widening the hash changes the wire, so it is a VERSION bump and a migration, not a patch.

pub const PAYLOAD_LEN: usize

Length of the encoded payload: version byte followed by the hash.

pub const ENCODED_LEN: usize = 44

Length of the canonical string form.

off (3) + separator (1) + data (34) + checksum (6). The data part is 34 characters because 21 bytes is 168 bits, which needs 34 five-bit groups and leaves 2 padding bits.

pub fn from_hash_bytes(hash: [u8; 20]) -> Self

Builds an address from a truncated identity-key hash.

Infallible: every 20-byte value is a valid address payload.

pub fn from_payload(payload: &[u8]) -> Result<Self, AddressError>

Builds an address from a version ‖ hash payload.

pub fn hash_bytes(&self) -> &[u8; 20]

Returns the truncated identity-key hash.

pub fn payload(&self) -> [u8; 21]

Returns the version ‖ hash payload.

pub fn version(&self) -> u8

Returns the address version byte.

Trait Implementations

impl Clone for Address

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Address

impl Debug for Address

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Address

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

Deserialize this value from the given Serde deserializer.

impl Display for Address

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

Formats the value using the given formatter.

impl Eq for Address

impl FromStr for Address

type Err = AddressError

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl Hash for Address

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 Ord for Address

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl PartialEq for Address

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for Address

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for Address

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Address