Walk the substitution following variable-to-variable links (union-find style), returning the canonical [`VarId`] for the chain. Stops at the first non

Build a representative two-attribute Person concept query with mixed variable / constant bindings for the serde round-trip tests.

Returns the schema for this formula.

Returns the schema describing this application's parameters.

Seed `entity_count` stuff entities, each with a `stuff/name` and a `stuff/role`, in a single transaction. Like [`seed`](Self::seed) this is intention

Seeks to the specified index in the facts stream. This method triggers background loading of facts up to the specified index if they haven't been loa

Regroups `keys` (as little-endian `[u8; 4]` entries) into leaf segments with the geometric distribution, returning each segment's entries.

Execute a select against a single branch, transparently routing through the branch's remote upstream when configured. Extracted as a freestanding help

Fisher-Yates shuffle.

Compute the [`SortKey`] for an artifact. Uses the same `key_bytes()` / `data_type()` / `to_reference()` the tree's own index keys are built from (`En

Compute and return the sum (by adding multiplicities) of this [ZSet] and another one

Fixed seed so the statistical tests are deterministic; the assertions then verify exact, reproducible outcomes rather than racing sigma tolerances aga

Get the 'the' (attribute) term.

Constrain selected [`Artifact`]s to attributes whose name begins with `prefix`. A prefix is a constraint, so the resulting selector is [`Constrained`]

Serialize the container to DAG-CBOR bytes.

Serialize to DAG-CBOR bytes (UCAN container format).

Serialize to DAG-CBOR bytes in the UCAN container format. The container format is: `{ "ctn-v1": [delegation_0_bytes, ...] }` where delegations are in

Convert this [`Value`] to its byte representation

Encode this concept as CBOR for hashing. Creates a CBOR-encoded map where: - Keys are attribute URIs (`the:{hash}`) in sorted order. - The value for

Serialize a value to a DAG-CBOR/SHA2-256 CID. # Panics Will panic if the value cannot be serialized or if the multihash cannot be created. We assume

Format this attribute's hash as a URI Returns a string in the format: `the:{base58(blake3)}`

Serialize this [`Value`] to a UTF-8 string

Returns the upper bound key of this node as an owned key. For a persistent node the bound is recovered from its serialized buffer; for a transient no

Returns the underlying URL.

Validate the type contract of this coalesce against a unification context: pick a fresh `α`, then unify `α` with `source`'s underlying (non-Nothing) s

Adapt polymorphic literals to the row's scheme instantiation. For each scheme group, the row's *variable* members determine the instantiation (the da

Convert address bytes to a JS string key for IndexedDB. Addresses are expected to be valid UTF-8.

The set of numeric types this value can instantiate to losslessly — the kind a polymorphic literal contributes to inference (so `1` does not pin a sch

Applies one edit to a sorted segment in place.

Build an archive capability from UCAN args: `Subject -> Archive -> Catalog -> Attenuation`.

Encodes the [`Revision`] as IPLD-compatible CBOR and returns the hash reference to the bytes

Interprets this node as a segment, erroring if it is an index. Mirrors [`PersistentNode::as_segment`](crate::PersistentNode::as_segment).

If this set has exactly one `ValueType` member (and nothing else, not even `Nothing`), return it. A `Nothing`-only set returns `None`; it has no `Valu

The prefix bound on attribute names, if any

Returns the set of variables this step will bind.

A reference to a named branch at this remote repository.

Build a delegation store from parsed proofs.

Returns the field's cardinality.

Categorize a premise's parameters against a set of already-bound variables: which it will bind, and which it still requires. This is the single defin

Attach a cause (provenance) to this expression. Accepts a concrete [`Cause`], [`Option<Cause>`], or a [`Term<Cause>`].

Create a typed cell within this branch's space.

Returns a mutable reference to this index node's child at `at`, already lifted to transient form. Errors if this node is a segment, the index is out

Clear the journal, typically before starting a new operation to measure.

The `db.rule/conclusion` index attribute, validated at compile time.

Returns `true` iff `vt` is a member of this set.

Returns `true` iff the `Nothing` atom is a member.

Like [`Self::content`] but attaches a variable name to the resulting [`EvaluationError::Absent`] so callers can report which slot was Absent.

Returns the handle for a site secret at the given address. Layout: `{space_root}/credential/site/{hash(address)}`

Derive the IndexedDB database name for a [`Location`].

Decodes a binary buffer into a columnar data structure with zero-copy access. This function takes a buffer previously encoded with [`encode`] and rec

Decodes a spec key back into its base bytes (everything before the `0x00` separator).

Derive an adornment from a concept's terms and the current match. Parameters are sorted alphabetically by name for determinism. A parameter is "bound

Converts this compiled rule back into a serializable [`DeductiveRuleDescriptor`]. Reconstructs the `when`/`unless` split from the analyzed premises.

The underlying attribute descriptor.

Disable journaling - operations will not be recorded

Read the full cached edition.

Enable journaling - operations will be recorded

Encodes a columnar data structure into a binary buffer with deduplication. This function takes a data structure that implements [`Cellular`] and enco

The encoder used for serialization.

The environment reference.

Export to multicodec-tagged bytes for native storage.

Merge every per-concept rule set from `other` into this registry. Entries that exist on both sides are folded together via [`ConceptRules::extend`] s

Extract generic arguments from a type like `Foo<A, B>`.

Helper for the [`Display`] impls on [`DeductiveRule`] and [`InductiveRule`]; both render their schema the same way.

Convert an `Ipld` value into a `Promised`, detecting promise maps.

Returns the parameter associated with the given name, if has one.

Get a copy of all recorded operations (both reads and writes) in the order they occurred.

Get all operations (both reads and writes) for a specific key in the order they occurred.

Get a map of how many times each key was read.

Get only the read operations in the order they occurred.

Get a map of how many times each key was written.

Groups a flat, ordered list of children into nodes by the canonical cut rule: a group ends at the first child whose rank exceeds `level_threshold`. `