Returns the handle for this space's certificate directory.

Returns the conclusion predicate for this rule.

Returns `true` iff the term is bound (Present *or* Absent) in this match. Use [`Self::is_present`] to check for `Present`-only.

Convenience: the attribute's content type, if known.

Returns the number of tasks currently queued. This count decreases as tasks complete during [`join`](Self::join).

Get the credential.

Encode a payload using this header's codec. # Errors Returns the codec's encoding error if encoding fails.

Evaluate: filter rows whose value's lexical form does not begin with the prefix. - Subject and prefix both `Present`: yield iff the subject has a lex

Check if this location exists.

Expands the node covering `bound`, if any. The frontier is sorted by upper bound, so the first node whose upper bound is `>= bound` is the only one w

Retrieves a node by its content hash. Checks the cache first, then the storage backend. Returns an error if the node is in neither.

Inserts a delegation and returns its CID. # Errors If insertion fails, an error defined by the `impl DelegationStore` is returned (the `S::InsertErr

Insert a resource for the given address, returning the old one if present.

Get the inner Vec for compatibility

Returns an iterator over all dependencies as (name, requirement) pairs.

Load an existing remote.

Merge sorted artifact streams into one stream whose order matches what a single physical prolly tree containing every input would produce, deduplicati

Get the operator DID.

Query `employee` and return the derived entities.

Run the public [`Stuff`] concept query and report the block reads of the *whole* query. Does not seed — the caller seeds via [`seed_stuff`](Self::seed

The internal array represented by this [`EntityKeyPart`]

Redeem this authorization at the access service for a presigned URL permit.

Resolve a [`Type`] to its current form under the substitution, recursively following any variables that have been bound until reaching a static type o

Retrieves bytes by their content hash, verifying the hash matches.

Get the hash that represents the [`ArtifactStore`] at its current version.

Run a select-by-attribute query against the seeded branch, recording block reads via a [`JournaledStorage`] wrapper. The query scans the branch's ind

Prefix predicate: this term's value has a lexical form beginning with `prefix`. Ranges over the TEXTUAL kinds; a constant prefix narrows the subject t

Sets a human-readable description for this cell, returning `self` for chaining.

Produce a hash reference to this [`Value`]

Convert bytes to a JS Uint8Array.

Creates a file at the given path (relative to root) and returns a handle for writing. Intermediate directories are created as needed.

Returns a reference to the address this cell is positioned at.

Convert to invocation arguments.

View the raw version bytes.

Reconstruct the syntactic premise this step was lowered from. The payload is the lowered, already type-narrowed form of the query, so this is a faith

Get the [`Entity`] as a string reference

Converts this error into a [`TypeError`] by attaching a binding name.

Build a valid UCAN container with invocation and delegation for testing

Returns the hash bytes as a 32-byte array reference.

Convenience: the attribute's cardinality.

Given two artifacts for the same `(attribute, entity)` pair, return the winner. The winner is the artifact with the higher cause; when causes are equa

* Closes session & cancels all the subscribers.

Commit a stream of changes to this branch.

Compute the rank of a hash using a threshold-based geometric distribution. The first 8 bytes of the hash are interpreted as a little-endian `u64` pre

Look up the constraint for a variable. Returns [`Primitive::ALL`] if the variable is unknown to this context.

Check whether the pool already contains a resource for the given address.

Create a test invocation chain with a valid delegation.

Encode this envelope payload for signing/verification using the header's codec. # Errors Returns the codec's encoding error if encoding fails.

Encode a value into bytes.

The effective expiration time across all delegations. Returns the earliest `expiration` in the chain (most restrictive). `None` means no delegation i

Export a public key as raw bytes.

Install every rule from `other` into this `ConceptRules`. Used when combining two rule sources (e.g. a primary registry and an overlay) so all instal

Extract doc comments from attributes

Wrap an artifact stream in a filter that drops any item whose [`sort_key`] is in `tombstones`. No-op when the set is empty.

Read a block from the remote archive by hash.

Get all read operations for a specific key in the order they occurred. Returns references to the journal entries via their offsets.

Get a reference-counted pointer to the internal entity index of the [`Artifacts`]

Convert into the given numeric type *losslessly*: `None` when the value is not exactly representable there. The literal adaptation primitive: a polymo

Compute the intersection of two time ranges (most restrictive).

Consume the wrapper and return the raw bytes.

Consume the capability and return the owned effect.

Deserializes an archived value into an owned value. The [`Archive::Archived`] type is a zero-copy representation that references serialized bytes dir

Unwraps an already-lifted node to its [`TransientNode`]. Errors if the node is still a [`Node::Persistent`] reference. Callers use this where an edit

Whether this is the wildcard "any" subject.

Returns `true` iff this term's kind admits the `Nothing` atom, i.e. the slot is set-widened. Untyped terms (no kind) return `false`.

Convert this [`Uri`] to the byte representation expected for use as part of an index key. The layout is 64 bytes wide. The first 32 bytes contain the

Converts a given path into a normalized path rooted on the internal `root`. Prevents path traversal by resolving `..` components and verifying the res

Join the address with the root directory to form the file path. The address is treated as a path component. If it contains invalid path characters, f

Returns the next cell as a zero-copy slice into the original buffer. This method reads the next cell index from the encoded buffer, looks up the corr

The effective earliest validity time across all delegations. Returns the latest `not_before` in the chain (most restrictive). `None` means no lower b

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

Execute the create operation.

Lower a single proposition to its compiled `Plan` for the given binding scope. Tests that exercise a concept/attribute proposition in isolation run it