The system within Arkosom
Memory, Signal, System, and Legacy are organizing principles for Arkosom’s operations, services, and internal development. Rememberer.org and Tomorrower.org are separate publishing and philosophical platforms. Stasrift is released contract-validation software. Perstia, Blututh and Data-Line are in development. Technology statuses and limits distinguish their roles.
Arkosom is not an AI company. AI is optional, replaceable, and provider neutral. Core continuity must not require an AI provider. People retain authority over access, interpretation, and action.
The local lifecycle
Create → Validate → Commit Locally → Preserve → Queue → Connect → Verify → Reconcile → Continue
Arkosom is designed local first so acknowledged committed local state does not depend on continuous network connectivity. The record exists before the network. This design statement assumes a successful local commit and usable local storage; it is not a claim about hardware failure, corruption, storage eviction, or every operating environment.
Create a record → commit locally → issue a local receipt → queue → optionally synchronize through a compatible interface → acknowledge → retrieve → verify integrity → display verified state.
In this developing architecture, Data-Line is intended to transport and acknowledge records. It does not confer truth or authority on their contents. Existing local, queued, syncing, synced, conflict, and failed states describe different outcomes; a transport acknowledgement alone does not establish verified recovery.
The disruption lifecycle
Operate → Detect → Reroute or Isolate → Preserve → Reconnect → Verify → Reconcile → Restore → Rebound → Continue
Loss of connection alone does not imply loss of acknowledged committed local state.
Graph theory describes connectivity.
Graph theory is established mathematics, not an Arkosom invention.
G = (V, E)
G₀ → G₁ → G₂
V is a set of vertices (nodes). E is a set of edges linking nodes. A path is a sequence of adjacent vertices linked by edges. Multiple appropriate paths can provide redundancy against specified failures. A partition separates parts of a graph so no path connects them.
The graph states G₀, G₁, and G₂ describe topology at successive steps. Edges can fail and return. Equal topology at two times does not imply equal event history.
In the teaching example, A is a local store, B a peer, and C a relay. A to B and A to C to B are edge disjoint paths between A and B. They share endpoints, so they do not protect against failure of A or B. Illustrative paths are not a claim about production redundancy.
Memory, Signal, System, and Legacy are Arkosom’s four pillars. They are responsibilities, not four mandatory physical nodes. A supported relationship between records also needs provenance; drawing an edge cannot establish that support.
Rebound is verified recovery.
R = I ∧ S ∧ H ∧ P ∧ D ∧ A
Read ∧ as “AND.” This is an Arkosom engineering model, not an established theorem. R may be satisfied only when every required condition is positively verified for the defined scope. Unknown is not satisfied, and unknown is not the same as false.
- I · Identity
- The returning participants are identified and authenticated for their expected roles.
- S · Integrity and state verification
- Required records and state have been checked against the defined integrity criteria.
- H · History reconciliation
- Relevant histories have been compared; corrections, conflicts, gaps, and their disposition remain explicit.
- P · Required paths
- The paths needed for the specified operation are available and authorized for use.
- D · Required redundancy
- The independently defined redundancy requirement has been restored and verified against its failure assumptions.
- A · Authority and conflict safety
- Required permissions and human decisions are valid; unresolved conflicts block unsafe operations.
The scope, required paths, redundancy policy, evidence, and responsible authority must be defined before a real evaluation. The public example supplies illustrative outcomes; it does not perform those checks on the beta.
Reconnection enters quarantine. Verification precedes authorized reconciliation. Normal traffic resumes only on eligible paths. Restoring one route can enable degraded operation while Rebound remains incomplete.
Reconnection does not mean overwrite. Reconnection does not mean recovery. Recovery requires verified Rebound. Recovery does not erase the occurrence of failure.
Point, Line, and Gap
- Point
- A preserved record, event, or observation, including its known context.
- Line
- A supported relationship with provenance. Support can be inspected and corrected.
- Gap
- Explicitly retained uncertainty or missing continuity, without an invented relationship.
Unknown ≠ False
Inference ≠ Fact
An optional assistive tool may retrieve, compare, analyze, propose relationships, identify gaps, and assist reconciliation. It cannot silently turn PROPOSED into VERIFIED. A recorded observation may itself be mistaken. A preserved claim remains a claim until its support is established.
Preservation has a purpose.
Continuity does not require every payload to be retained forever. Privacy, scoped access, retention, deletion, and corrections apply. Preserve the evidence needed to explain a failure and its resolution within those policies.
Authority remains with the authorized people and processes. Connectivity, recency, synchronization, and generated text do not grant AI decision rights.