Derives the content-addressed path for a blob from its Blake3 hash.

Hydrate a compiled [`DeductiveRule`] from a `db.rule/source` claim value (the canonical dag-cbor [`DeductiveRuleDescriptor`]).

Build a where clause that includes existing predicates plus `Self: Serialize + DeserializeOwned` (needed when `Attenuation = Self`).

Import artifacts into this branch from the given importer. Each artifact read from the importer is committed as an assertion.

async is needed on WASM

Body premises: - read the existing counter's count into ?prev - derive ?count = ?prev + 1 via math/sum

Integrate an external [`Changes`] batch into this transaction. Each instruction is replayed as if it had been asserted or retracted on the transactio

The keys in `range` that are interior (not segment boundaries).

Convert to an instruction stream.

Consume the container and return the tokens.

Check if this term is an unnamed variable (wildcard). Unnamed variables match anything but don't produce bindings.

Check if this term is a constant value

Returns `true` if the given [`JsValue`] is a `NotFoundError` DOMException.

Checks if this is a required (non-derivable) dependency.

Iterate over the bound variable names.

Returns a mutable iterator over all `(name, field)` pairs.

Join: the weakest constraint both sides imply — the longest common prefix. `None` when nothing is common (the join carries no refinement).

Compare per scan mode: collect sort_keys from a raw branch scan and from the Changes overlay; they must match exactly. (Full Artifact equality would f

A discriminant tag per step, so order tests can assert the exact kind* of each step in sequence (not just its binds).

Open an existing database, failing if it was never created. IndexedDB's `open` brings a database into being, so the base `Resource::load` (which dele

Checks if the hash of the given bytes matches this hash.

Meet: the conjunction of both constraints. Two prefixes are jointly satisfiable iff one extends the other, and the meet is the longer; disjoint prefix

Build a memory capability from UCAN args: `Subject -> Memory -> Space -> Cell -> Attenuation`.

The smallest [`ValueDataType`] in discriminant order

Moves a file from one rooted path to another. Intermediate directories for the destination are created as needed. Both `from` and `to` are resolved r

Returns the relation name.

The branch name.

The branch name.

Iterate over `(name, VarId)` pairs for every named variable allocated in this context. The order is unspecified.

Get the next alphabetic key (a -> b -> c -> ... -> z -> aa -> ab -> ...)

An optional (set-widened) concept field wrapping the given attribute descriptor.

Creates a new join of two plans.

Returns the parent directory of `path`, clamped to [`self.root`]. If the path has no parent or its parent falls outside the root, the root itself is

Parse the `time` field from a fixture entry as a `Timestamp`.

Execute the load operation.

Execute the reset operation.

Delegates a point lookup over a fully persistent subtree rooted at `hash` to [`PersistentTree::get`], so the transient read of an untouched subtree is

Lower a single negated premise to its compiled `Plan` and evaluate it. Negation requires its variables bound, so the planning scope declares them; the

Returns the position index of a node within its parent's children list.

Get the profile DID.

Provide evidence for the given term: look up the claim it cites.

The geometric rank of a `u32` key, hashed the same way the tree hashes it.

The geometric rank of a `u32` key, hashed the same way the tree hashes it.

Re-resolve this handle's head and upstream from storage, updating its caches to the current versions. The recovery path for a stale handle. [`pull`](

Reloads content from storage, replacing the cached state entirely.

Get a remote reference for the given name. Call `.create(address)` or `.load()` on the returned reference.

Returns a copy of this set with the `Nothing` atom removed, leaving only the present-value shapes it admits.

Required operand names of the head.

Cell representing the remote's own branch revision. Rooted at the remote repo's subject; path `memory/branch/{branch_name}/revision`. Used as the in-

Schema of the wrapped lookup, adjusted for the left-join contract: the entity slot is hard-required (outside the choice group; absence is read relativ

Returns the schema for this constraint. The schema describes what parameters the constraint requires to be evaluable.

Returns the schema describing this application's parameters.

Read a `db.rule/*` selector against a single branch's committed tree only (NOT the overlay) and collect the matching artifacts. The durable layer's re

Returns the parent node hash and tree node of the currently selected node.

Build a tree from `keys`, then delete `to_delete`, each operation in its own single-operation edit batch, flush, and return the resulting tree. This i

Walks the persisted tree to recover its height, node counts, per-level fan-out and total persisted byte size.

An order signature for a planned conjunction: the per-step sorted binds, in execution order. Two plans with the same signature schedule the same work

The `db.rule/source` body attribute, validated at compile time.

Returns the tree statistics, triggering computation if not yet available. The statistics are computed asynchronously in the background and cached onc

Streams the entries of every node remaining in the frontier, in key order, descending through any nodes that are still indexes.

* Subscribes to the provided query & calls `subscriber` every time changes * are transacted in this session allowing subscribes to react to changes

Returns the tag byte that identifies the key type (entity, attribute, or value)