Skip to main content

GraphConfig

Struct GraphConfig 

Source
pub struct GraphConfig {
Show 25 fields pub enabled: bool, pub extract_model: String, pub max_entities_per_message: usize, pub max_edges_per_message: usize, pub community_refresh_interval: usize, pub entity_similarity_threshold: f32, pub extraction_timeout_secs: u64, pub use_embedding_resolution: bool, pub entity_ambiguous_threshold: f32, pub max_hops: u32, pub recall_limit: usize, pub expired_edge_retention_days: u32, pub max_entities: usize, pub community_summary_max_prompt_bytes: usize, pub community_summary_concurrency: usize, pub lpa_edge_chunk_size: usize, pub temporal_decay_rate: f64, pub edge_history_limit: usize, pub note_linking: NoteLinkingConfig, pub spreading_activation: SpreadingActivationConfig, pub link_weight_decay_lambda: f64, pub link_weight_decay_interval_secs: u64, pub belief_revision: BeliefRevisionConfig, pub rpe: RpeConfig, pub pool_size: u32,
}
Expand description

Configuration for the knowledge graph memory subsystem ([memory.graph] TOML section).

§Security

Entity names, relation labels, and fact strings extracted by the LLM are stored verbatim without PII redaction. This is a known pre-1.0 MVP limitation. Do not enable graph memory when processing conversations that may contain personal, medical, or sensitive data until a redaction pass is implemented on the write path.

Fields§

§enabled: bool§extract_model: String§max_entities_per_message: usize§max_edges_per_message: usize§community_refresh_interval: usize§entity_similarity_threshold: f32§extraction_timeout_secs: u64§use_embedding_resolution: bool§entity_ambiguous_threshold: f32§max_hops: u32§recall_limit: usize§expired_edge_retention_days: u32

Days to retain expired (superseded) edges before deletion. Default: 90.

§max_entities: usize

Maximum entities to retain in the graph. 0 = unlimited.

§community_summary_max_prompt_bytes: usize

Maximum prompt size in bytes for community summary generation. Default: 8192.

§community_summary_concurrency: usize

Maximum concurrent LLM calls during community summarization. Default: 4.

§lpa_edge_chunk_size: usize

Number of edges fetched per chunk during community detection. Default: 10000. Set to 0 to disable chunking and load all edges at once (legacy behavior).

§temporal_decay_rate: f64

Temporal recency decay rate for graph recall scoring (units: 1/day).

When > 0, recent edges receive a small additive score boost over older edges. The boost formula is 1 / (1 + age_days * rate), blended additively with the base composite score. Default 0.0 preserves existing scoring behavior exactly.

§edge_history_limit: usize

Maximum number of historical edge versions returned by edge_history(). Default: 100.

Caps the result set returned for a given source entity + predicate pair. Prevents unbounded memory usage for high-churn predicates when this method is exposed via TUI or API endpoints.

§note_linking: NoteLinkingConfig

A-MEM dynamic note linking configuration.

When note_linking.enabled = true, entities extracted from each message are linked to semantically similar entities via similar_to edges. Requires an embedding store (qdrant or sqlite vector backend) to be configured.

§spreading_activation: SpreadingActivationConfig

SYNAPSE spreading activation retrieval configuration.

When spreading_activation.enabled = true, graph recall uses spreading activation with lateral inhibition and temporal decay instead of BFS.

§link_weight_decay_lambda: f64

A-MEM link weight decay: multiplicative factor applied to retrieval_count for un-retrieved edges each decay pass. Range: (0.0, 1.0]. Default: 0.95.

§link_weight_decay_interval_secs: u64

Seconds between link weight decay passes. Default: 86400 (24 hours).

§belief_revision: BeliefRevisionConfig

Kumiho AGM-inspired belief revision configuration.

When belief_revision.enabled = true, new edges that semantically contradict existing edges for the same entity pair trigger revision: the old edge is invalidated with a superseded_by pointer and the new edge becomes the current belief.

§rpe: RpeConfig

D-MEM RPE-based tiered graph extraction routing.

When rpe.enabled = true, low-surprise turns skip the expensive MAGMA LLM extraction pipeline. A consecutive-skip safety valve ensures no turn is silently skipped indefinitely.

§pool_size: u32

SQLite connection pool size dedicated to graph operations.

Graph tables share the same database file as messages/embeddings but use a separate pool to prevent pool starvation when community detection or spreading activation runs concurrently with regular memory operations. Default: 3.

Trait Implementations§

Source§

impl Clone for GraphConfig

Source§

fn clone(&self) -> GraphConfig

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for GraphConfig

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Default for GraphConfig

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl<'de> Deserialize<'de> for GraphConfig

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Serialize for GraphConfig

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DynClone for T
where T: Clone,

Source§

fn __clone_box(&self, _: Private) -> *mut ()

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> FromRef<T> for T
where T: Clone,

Source§

fn from_ref(input: &T) -> T

Converts to this type from a reference to the input type.
Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> IntoRequest<T> for T

Source§

fn into_request(self) -> Request<T>

Wrap the input message T in a tonic::Request
Source§

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,