Skip to content

Dots Brain 0.4.0

Choose a tag to compare

@OnFiala OnFiala released this 13 Oct 20:02
  • Retain schema v2 and the explicit released v1 migration. Add read-only version
    checks, FTS secure deletion, snapshot/recovery validation and writer/HTTP leases.
  • Preserve OAuth client/grant provenance after invalidation; bind public policy
    to its listener and make bulk access changes explicit offline maintenance.
  • Reject known secrets, warn on uncertain content, retain successful writes when
    later auditing fails, and report unknown remote outcomes without automatic retry.
  • Return the source body/revision with title matches; make indexing counts and
    FTS fallback explicit and isolate bridge sessions for concurrent calls.
  • Publish managed state after readiness; bind process control to its data path.
    Add read-only connect with failure rollback and explicit supervisor endpoints,
    independent doctor checks, timestamps and one startup log rotation.
  • Add ownership-aware disconnect and uninstall that preserve unrelated client
    settings, changed credentials and retained memory data.
  • Add schema-v2 audit review with checkpoint continuity and operator diagnostics.
  • Exclude disabled CORTEX and capture modules and their tests from the core
    distribution while preserving their source-only characterizations.
  • Add installed-wheel verification using a released synthetic v1 fixture and
    real stdio MCP.

This version uses selected changes from the later experimental branch; its
v3/v4 schemas and additional command surfaces are not part of this v2 result.

Known limitations

  • Corrections: assistants often store a correction as a new memory instead of a new revision of the existing one. The server supports in-place revisions (memory_remember with the same project, source, account and event_id plus expected_revision), but the tool description does not explain this yet, so search can return both the old and the corrected memory.
  • Ranking: in hybrid search, a full-text match on a very common word carries the same weight as the strongest semantic match, and equal scores are ordered arbitrarily. A paraphrased query can therefore rank the best semantic match below the top three.