Struct GraphHash 

pub struct GraphHash(pub [u8; 32]);

32-byte BLAKE3 content hash. The canonical identity of every graph in the store.

Carries rkyv Archive derives so wire types in sui-protocol (and any future archived form referring to a stored blob) can embed it cheaply. The archived form is a fixed-32-byte fixed-layout, so zero-copy reads of a GraphHash are a literal pointer offset.

Tuple Fields

0: [u8; 32]

Implementations

impl GraphHash

pub fn of(bytes: &[u8]) -> Self

Compute the BLAKE3 of an arbitrary byte slice. This is the canonical “what’s the hash of these archive bytes” entry point — callers compute it once at archive time and again at retrieve time to verify.

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

Raw 32-byte form. Useful when threading into a fixed-width keying surface (redb key, protobuf bytes field, etc.).

pub fn display_short(&self) -> String

Truncated display form (52 base32 chars, matches Nix store digest length). Used in file names and log lines.

pub fn shard_prefix(&self) -> (String, String)

Two-byte/two-byte fan-out prefix for the on-disk path. Returns (aa, bb) where aa and bb are the first two and second two hex characters of the hash — chosen so the fan-out spans 256 × 256 = 65 536 leaf directories without ever stat-ing more than ~16 blobs per leaf (Git’s proven shape).

Trait Implementations

impl Archive for GraphHash

where [u8; 32]: Archive,

const COPY_OPTIMIZATION: CopyOptimization<Self>

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

type Archived = ArchivedGraphHash

The archived representation of this type.

type Resolver = GraphHashResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

impl Clone for GraphHash

fn clone(&self) -> GraphHash

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphHash

impl Debug for GraphHash

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

Formats the value using the given formatter.

impl<__D: Fallible + ?Sized> Deserialize<GraphHash, __D> for Archived<GraphHash>

where [u8; 32]: Archive, <[u8; 32] as Archive>::Archived: Deserialize<[u8; 32], __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<GraphHash, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl Display for GraphHash

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

Nix-style base32 of the full 32-byte digest. Stable across runs.

impl Eq for GraphHash

impl FromStr for GraphHash

type Err = Error

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 GraphHash

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 GraphHash

fn cmp(&self, other: &GraphHash) -> 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.

impl PartialEq for GraphHash

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for GraphHash

fn partial_cmp(&self, other: &GraphHash) -> 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<__S: Fallible + ?Sized> Serialize<__S> for GraphHash

where [u8; 32]: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl StructuralPartialEq for GraphHash