Removes the child at `at` from `children` and unwraps it to its transient form. The child is on the lifted path, so it is always transient.

Content-addressed identity, panicking if the rule has no encodable body. Use on the storage path; prefer [`try_this`](Self::try_this) otherwise.

Extract a tombstone set from a [`Changes`] overlay — one [`SortKey`] per retracted artifact. Asserts and Replaces are ignored; only Retracts contribu

Returns the tree root at the last sync point.

Canonical encoding of this rule's descriptor, if it has one — the dag-cbor bytes, deterministic by construction. Returns `None` when the rule body ca

This rule's content-addressed identity, if it has a canonical encoding: `rule:<base58(blake3(dag-cbor(descriptor)))>`. `None` for rules with no encod

Send this permit with a request body.

Borrows the upper bound key of this node without cloning it. A persistent node's bound lives in its owned [`Link`]; a transient node's is the key of

Validates a relation literal as raw bytes. This is a `const fn` returning `Result` so it can be used both at compile time (from the [`the!`] macro) a

Computes the identity hash used for last-write-wins conflict resolution: the blake3 hash of the value's serialized (rkyv) form, the same canonical byt

Look up or allocate the `VarId` associated with a name in this scope. The first call for a given name allocates with the maximally-permissive constrai

Create the repository with a caller-supplied credential instead of generating a fresh keypair. Useful when the space name is derived from the credent

Returns a new upstream with the tree updated to the given value.

Return a copy of this query with the `is` term's type narrowed to `kind`. The planner uses this to stamp the rule-inferred kind onto the value variabl

Returns a stream that yields each chunk with an explicit yield between items, forcing the async runtime to interleave concurrent tasks at every chunk

Acquire a PID lock at the given handle. If a stale lock exists (from a dead process), it will be automatically cleaned up and the lock acquired. If

Adds the given multiplicity to the current multiplicity (or zero, if the entry is not yet recorded), records the new value and returns it.

Adds multiple key-value pairs to this delta.

The TEXTUAL members whose lexical grammar admits a value beginning with `prefix`. Conservative: a member is dropped only when *no* value of that kind

True when a fact's value inhabits the `is` term's kind. A typed value slot is a constraint: attribute values are dynamically typed in the store (one a

Build the revision that follows `self`, advancing the logical clock. When the same issuer commits again the `moment` counter increments; a different

Get the [signature algorithm] for this varsig configuration. [signature algorithm]: <https://github.com/ChainAgnostic/varsig/blob/main/README.md#sign

Sets the constrained parts of the given [`ArtifactSelector`] to the associated components of this [`KeyView`]

Returns the raw bytes of the checksum.

Get the PKCS#8 bytes as a slice.

Get the constant value if this term is a constant. Returns None for variables.

Get the inner map.

The identifier string.

Assert a claim.

Sign a permit with SigV4, returning a new permit with presigned URL.

Authorize this fork against an environment, producing a [`ForkInvocation`] ready for execution. Internally this converts the generic `Fork<S, Fx>` in

Applies `keys` to a fresh [`Edit`] in order, then persists and returns the root hash.

Build the authority chain for the given subject DID.

Build a rank map from the tree spec. Height 0 boundaries get rank 2, height 1 boundaries rank 3, and so on. If a boundary appears at multiple heights

Get the 'cause' term.

Type checks that the provided parameter is compatible with this cell's kind: the meet of the two must be inhabited. A kindless cell accepts anything;

Checks that the given parameter's type is compatible with this attribute's content type.

Convert a `CheckFailed` error to a `ContainerError`.

Cite a claim as evidence for the given term.

Walks the transient `node` left to right, appending each persistent subtree (as a hash) and each transient leaf entry (cloned) to `plan` in ascending

Compile this definition into an [`InductiveRule`] ready for evaluation.

Structural inclusion check between two [`Composite`] shapes. `a` includes `b` iff they are the same shape kind, have matching keys/labels, and each of

The conclusion (head) of this rule.

Selector for `db.rule/conclusion is = <concept>` — finds the rule entities concluding a concept.

Validates the provided parameters against the schema of the attributes.

Type-checks an optional parameter against this attribute.

Validates a model against this descriptor's schema and creates an instance.

Returns true if a variable name is bound in this environment.

Returns the estimated execution cost.

Whether `prefix` could begin the serialized form of an entity URI. Entities serialize through the WHATWG URL algorithm, whose output always begins `s

Build the head: a counter row with a `count` field.

Check whether this range covers (is at least as wide as) the required range. A `None` bound in the requirement means "no constraint" on that side. A

Create a bucket if it doesn't exist.

Get the current time as a UTC datetime.

Whether an IndexedDB database with this name currently exists. Uses `indexedDB.databases()`, which enumerates existing databases without opening* (so

Returns a clone of the database handle.

Declared optionality no result can exercise: variables some premise set-widened with `Nothing` that the rule's other premises require present. Sound,

Rebuild a rule from its canonical dag-cbor [`encode`](Self::encode) bytes. `Err` carries a human-readable reason — either the cbor decode failed or th

Decode bytes into a typed value.

Parse a JSON string literal starting at a `"` # Returns `(decoded_string, rest_after_closing_quote)`

Decrement the multiplicity of an element, setting it to -1 if it does not already exist in the [ZSet]

Returns the field description.

Returns the description of this concept, if any.

Round-trip this rule back to its serializable form.

Cached committed rule entities concluding `concept` if scanned at `head`; `None` if absent or stale (caller must re-scan the tree).

Returns the attribute domain.

The durable rules concluding `concept` on `branch`: the committed `db.rule/*` rules, read from the tree and cached by branch head (re-scanned only whe