Mark the start of a new turn.

Build edges connecting a decision node to the surrounding context. The decision node gets: - An edge from the most recent goal (if any precedes the s

Reject a REGISTERED directive name embedded mid-prose with an attrs brace (e.g. `… ::file-ref{path=x} …` inside a sentence). The block parser only rea

Combined stdout + stderr as a lossy string, for substring assertions.

Compare two byte slices and produce diff operations. This function handles the actual diffing of file content. # Arguments `old_content` - Content

Compute cosine similarity between two vectors. Returns 0.0 if the vectors have different lengths, are empty, or if either has zero magnitude.

Create a simple test change with the given message.

Decode a `SessionEnvelope` from `HashedChange.metadata` bytes. Validates the magic prefix and schema version before deserializing. # Errors Returns

Derive the agent author from the user's identity. Constructs: `{agent_name}+{session_short} <{user_email}>` If the user has no email, uses the agent

Synchronous embed using a throwaway tokio runtime (for use in non-async contexts). When called from within an existing Tokio runtime (e.g., from hook

Ensure that the required metadata sections (HEADER + DEPS) have been written.

Pure decision core for [`check_push_credentials`], split out so it can be unit-tested without touching the on-disk identity store. `explicit` — wheth

Extract edges from content text (wiki-links, file paths).

Extract a file path from a node's detail or summary.

Filter computed file diffs down to the paths given on the command line, rebuilding the aggregate stats from the surviving entries. This is a no-op wh

Find the vault path for an intent by its resolved manifest key. First checks the manifest's `vault_path` field (fast path), then falls back to scanni

Find the repository root starting from a specific path. Like [`find_repository_root`], but starts from the given path instead of the current working

Format entries for default output. # Arguments `entries` - History entries to format `hash_length` - Number of hash characters to display # Returns

Format a hash for display with custom length. Like [`format_hash`], but allows specifying the truncation length. # Arguments `hash` - The hash to f

Format entries for JSON output. # Arguments `entries` - History entries to format # Returns Formatted JSON string.

Format entries for short output. # Arguments `entries` - History entries to format `hash_length` - Number of hash characters to display # Returns

Get the changelist for a view starting from a position. # Arguments `view` - The name of the view to query. `from` - The starting position (sequence

Load an immutable session manifest by content hash.

Convert command options to TrackingOptions.

Returns `true` if the outcome is [`Clean`](Self::Clean).

Returns `true` if the graph has no nodes.

Check if a file path is supported for AST extraction.

Iterate over all change hashes stored in the repository. This scans the changes directory and yields the hash of each change file found. The iteratio

Iterate through all lines with their display status. Lines are yielded in the order they would appear in a unified diff: - Unchanged lines appear onc

Load an identity by ID.

Load a memory's attestation and classify it against the current source (`inputs`). Prefers the tracked vault entry, falling back to the legacy sidecar

Load an attestation from the repository by hash.

Load a full `Change` from the redb store. This reads all tables for the change and reassembles a `Change` object. Equivalent to deserializing a compl

Find the Longest Increasing Subsequence of matches by new_idx. Given matches sorted by old_idx, find the longest subsequence where new_idx values are

Create a test change with content

Marks this conflict as resolved with optional notes.

Mark a position as verified rooted.

Set maximum span count.

Set the maximum number of vertices to retrieve. This provides a safety limit for retrieval. If the graph exceeds this size, retrieval will stop and t

Merge parallel results into the aggregate vectors needed by `Repository::record()`. This extracts the `RecordedFile` values from the parallel results

Get the commit message if a header is loaded.

Get the effective model name.

Create a new name conflict. Name conflicts occur when a file has been renamed by concurrent changes.

Generate the next node ID.

Output graph content with semantic-merge resolution. This is the merge-aware counterpart of [`output_graph_content`]. For every SCC whose lead verte

Process files in parallel using rayon, returning per-file results. This is the core of the parallel recording pipeline (Phase 2). It takes a list of

Get the permission bits. # Returns The Unix permission bits.

Get the current byte position in the original content.

Set the previous provenance graph hash (for session resume chaining).

Print the status in long (human-readable) format.

Process a diff operation. This is the main entry point for processing diff output. Call this for each diff operation in sequence. # Arguments `op`

Process an insertion. # Arguments `old_index` - Position in old content (insertion point) `new_index` - Starting line in new content `new_len` - Num

Project a turn's provenance into the named-subgraph JSON-LD. Builds `urn:atomic:provgraph:<change_id_base32>` with `@graph = [prov:Activity, prov:Sof

Provision an agent's private working tree as a copy-on-write clone of this repository's working tree. Copies every tracked-or-untracked working file

PUT request with JSON body, unwrap `ApiResponse` envelope.

Record an agent turn as an Atomic change. This is the function that bridges the agent world into the VCS world. It builds a `ChangeHeader`, `Provenan

Remove a file or directory. If `recursive` is true, removes directories and their contents.

Initialize a repo (default view `dev`) with a base file recorded on `dev`.

Look up the index for a hash, returning an error if not found. This is a convenience method that wraps [`lookup`](Self::lookup) and converts `None` t

Resolve a source path that may be a `$variable` reference. If it starts with `$`, extract vault paths from the bound nodes (using the node label or m

Retrieve the alive graph for a file starting from a position. This function traverses the graph from the given starting position, collecting all aliv

Compute a single row using an explicit verifier keypair (no global store).