@auxiora/reasoning 0.1.0

package/LICENSE

@@ -0,0 +1,191 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to the Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by the Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding any notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2026 Auxiora Contributors
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/package.json

@@ -0,0 +1,10 @@
+{
+  "name": "@auxiora/reasoning",
+  "version": "0.1.0",
+  "type": "module",
+  "exports": {
+    ".": "./src/index.ts"
+  },
+  "dependencies": {},
+  "devDependencies": {}
+}

package/src/improvement-store.ts

@@ -0,0 +1,94 @@
+import { DatabaseSync } from 'node:sqlite';
+import type { ImprovementProposal } from './improvement-types.js';
+
+export interface StoredProposal extends ImprovementProposal {
+  id: number;
+}
+
+export class ImprovementStore {
+  private readonly db: DatabaseSync;
+  private closed = false;
+
+  constructor(dbPath: string) {
+    this.db = new DatabaseSync(dbPath);
+    this.db.exec('PRAGMA journal_mode=WAL');
+    this.db.exec('PRAGMA busy_timeout=5000');
+    this.db.exec(`
+      CREATE TABLE IF NOT EXISTS improvement_proposals (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        observationsJson TEXT NOT NULL,
+        reflectionsJson TEXT NOT NULL,
+        hypothesesJson TEXT NOT NULL,
+        validationsJson TEXT NOT NULL,
+        status TEXT NOT NULL,
+        createdAt INTEGER NOT NULL
+      )
+    `);
+    this.db.exec('CREATE INDEX IF NOT EXISTS idx_proposals_status ON improvement_proposals (status)');
+  }
+
+  record(proposal: ImprovementProposal): number {
+    if (this.closed) return -1;
+    const stmt = this.db.prepare(
+      'INSERT INTO improvement_proposals (observationsJson, reflectionsJson, hypothesesJson, validationsJson, status, createdAt) VALUES (?, ?, ?, ?, ?, ?)',
+    );
+    stmt.run(
+      JSON.stringify(proposal.observations),
+      JSON.stringify(proposal.reflections),
+      JSON.stringify(proposal.hypotheses),
+      JSON.stringify(proposal.validations),
+      proposal.status,
+      proposal.createdAt,
+    );
+    const row = this.db.prepare('SELECT last_insert_rowid() as id').get() as Record<string, unknown>;
+    return row.id as number;
+  }
+
+  getById(id: number): StoredProposal | undefined {
+    if (this.closed) return undefined;
+    const stmt = this.db.prepare('SELECT * FROM improvement_proposals WHERE id = ?');
+    const row = stmt.get(id) as Record<string, unknown> | undefined;
+    if (!row) return undefined;
+    return this.mapRow(row);
+  }
+
+  updateStatus(id: number, status: ImprovementProposal['status']): void {
+    if (this.closed) return;
+    const stmt = this.db.prepare('UPDATE improvement_proposals SET status = ? WHERE id = ?');
+    stmt.run(status, id);
+  }
+
+  getByStatus(status: ImprovementProposal['status']): StoredProposal[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare('SELECT * FROM improvement_proposals WHERE status = ? ORDER BY createdAt DESC');
+    return this.mapRows(stmt.all(status) as Record<string, unknown>[]);
+  }
+
+  getRecent(limit = 50): StoredProposal[] {
+    if (this.closed) return [];
+    const stmt = this.db.prepare('SELECT * FROM improvement_proposals ORDER BY createdAt DESC LIMIT ?');
+    return this.mapRows(stmt.all(limit) as Record<string, unknown>[]);
+  }
+
+  close(): void {
+    if (this.closed) return;
+    this.closed = true;
+    this.db.close();
+  }
+
+  private mapRows(rows: Record<string, unknown>[]): StoredProposal[] {
+    return rows.map((r) => this.mapRow(r));
+  }
+
+  private mapRow(r: Record<string, unknown>): StoredProposal {
+    return {
+      id: r.id as number,
+      observations: JSON.parse(r.observationsJson as string) as Record<string, unknown>,
+      reflections: JSON.parse(r.reflectionsJson as string) as Record<string, unknown>,
+      hypotheses: JSON.parse(r.hypothesesJson as string) as Record<string, unknown>,
+      validations: JSON.parse(r.validationsJson as string) as Record<string, unknown>,
+      status: r.status as ImprovementProposal['status'],
+      createdAt: r.createdAt as number,
+    };
+  }
+}

package/src/improvement-types.ts

@@ -0,0 +1,15 @@
+export interface ImprovementProposal {
+  observations: Record<string, unknown>;
+  reflections: Record<string, unknown>;
+  hypotheses: Record<string, unknown>;
+  validations: Record<string, unknown>;
+  status: 'pending_review' | 'approved' | 'rejected' | 'applied';
+  createdAt: number;
+}
+
+export interface StepDescription {
+  name: string;
+  description: string;
+  order: number;
+  required: boolean;
+}

package/src/index.ts

@@ -0,0 +1,13 @@
+export { StepRegistry } from './step-registry.js';
+export { StepToolGenerator } from './step-tools.js';
+export { MetaImprovementStructure } from './meta-improvement.js';
+export { ImprovementStore } from './improvement-store.js';
+export type { StoredProposal } from './improvement-store.js';
+export type { ToolLike } from './step-tools.js';
+export type { ImprovementProposal, StepDescription } from './improvement-types.js';
+export type {
+  ReasoningStep,
+  StepStatus,
+  StepState,
+  StepProgress,
+} from './types.js';

package/src/meta-improvement.ts

@@ -0,0 +1,93 @@
+import { StepRegistry } from './step-registry.js';
+import { StepToolGenerator } from './step-tools.js';
+import type { ReasoningStep } from './types.js';
+import type { ImprovementProposal, StepDescription } from './improvement-types.js';
+
+const META_STEPS: ReasoningStep[] = [
+  {
+    name: 'observe',
+    description: 'Collect performance metrics, error rates, and anomalies from recent operations. Output should include numeric metrics and notable anomalies.',
+    order: 1,
+    required: true,
+  },
+  {
+    name: 'reflect',
+    description: 'Analyze observations to identify patterns, correlations, and root causes. Output should include identified patterns and hypothesized root causes.',
+    order: 2,
+    required: true,
+  },
+  {
+    name: 'hypothesize',
+    description: 'Propose concrete changes based on reflections. Each proposal should include the change description and confidence level (0-1).',
+    order: 3,
+    required: true,
+  },
+  {
+    name: 'validate',
+    description: 'Test proposed changes against benchmarks or simulations. Output should include test results with pass/fail and measured improvement.',
+    order: 4,
+    required: true,
+  },
+];
+
+export class MetaImprovementStructure {
+  private readonly registry: StepRegistry;
+  private readonly toolGenerator: StepToolGenerator;
+
+  constructor() {
+    this.registry = new StepRegistry([...META_STEPS]);
+    this.toolGenerator = new StepToolGenerator(this.registry);
+  }
+
+  getCurrentStepName(): string | undefined {
+    return this.registry.currentStep()?.name;
+  }
+
+  completeStep(name: string, output: Record<string, unknown>): void {
+    if (!this.registry.isAvailable(name)) {
+      throw new Error(`Step "${name}" is not available. Current step: ${this.getCurrentStepName()}`);
+    }
+    this.registry.complete(name, output);
+  }
+
+  getProgress(): { completed: number; total: number; percentage: number } {
+    return this.registry.progress();
+  }
+
+  isComplete(): boolean {
+    return this.registry.isComplete();
+  }
+
+  getCurrentTools(): Array<{
+    name: string;
+    description: string;
+    parameters: Record<string, unknown>;
+    run(args: Record<string, unknown>): Promise<{ success: boolean; data: Record<string, unknown> }>;
+    getPermission(): string;
+  }> {
+    return this.toolGenerator.getCurrentTools();
+  }
+
+  buildProposal(): ImprovementProposal | undefined {
+    if (!this.isComplete()) return undefined;
+    const outputs = this.registry.getOutputs();
+
+    return {
+      observations: outputs.get('observe') ?? {},
+      reflections: outputs.get('reflect') ?? {},
+      hypotheses: outputs.get('hypothesize') ?? {},
+      validations: outputs.get('validate') ?? {},
+      status: 'pending_review',
+      createdAt: Date.now(),
+    };
+  }
+
+  getStepDescriptions(): StepDescription[] {
+    return META_STEPS.map((s) => ({
+      name: s.name,
+      description: s.description,
+      order: s.order,
+      required: s.required,
+    }));
+  }
+}

package/src/step-registry.ts

@@ -0,0 +1,118 @@
+import type { ReasoningStep, StepState, StepProgress } from './types.js';
+
+export class StepRegistry {
+  private readonly states: Map<string, StepState>;
+  private readonly ordered: ReasoningStep[];
+
+  constructor(steps: ReasoningStep[]) {
+    this.ordered = [...steps].sort((a, b) => a.order - b.order);
+    this.states = new Map();
+
+    for (const step of this.ordered) {
+      this.states.set(step.name, { step, status: 'pending' });
+    }
+
+    if (this.ordered.length > 0) {
+      this.states.get(this.ordered[0].name)!.status = 'available';
+    }
+  }
+
+  currentStep(): ReasoningStep | undefined {
+    for (const step of this.ordered) {
+      const state = this.states.get(step.name)!;
+      if (state.status === 'available') {
+        return step;
+      }
+    }
+    return undefined;
+  }
+
+  isAvailable(name: string): boolean {
+    const state = this.states.get(name);
+    if (!state) return false;
+    return state.status === 'available';
+  }
+
+  canSkip(name: string): boolean {
+    const state = this.states.get(name);
+    if (!state) return false;
+    return !state.step.required && state.status === 'available';
+  }
+
+  complete(name: string, output?: Record<string, unknown>): void {
+    const state = this.states.get(name);
+    if (!state) {
+      throw new Error(`Step "${name}" not found`);
+    }
+    if (state.status !== 'available') {
+      throw new Error(`Step "${name}" is not available`);
+    }
+    state.status = 'completed';
+    state.output = output;
+    state.completedAt = Date.now();
+    this.advanceNext(name);
+  }
+
+  skip(name: string): void {
+    const state = this.states.get(name);
+    if (!state) {
+      throw new Error(`Step "${name}" not found`);
+    }
+    if (state.step.required) {
+      throw new Error(`Step "${name}" is required and cannot be skipped`);
+    }
+    if (state.status !== 'available') {
+      throw new Error(`Step "${name}" is not available`);
+    }
+    state.status = 'skipped';
+    this.advanceNext(name);
+  }
+
+  progress(): StepProgress {
+    let completed = 0;
+    const total = this.ordered.length;
+    for (const state of this.states.values()) {
+      if (state.status === 'completed' || state.status === 'skipped') {
+        completed++;
+      }
+    }
+    return {
+      completed,
+      total,
+      percentage: total === 0 ? 100 : Math.round((completed / total) * 100),
+    };
+  }
+
+  isComplete(): boolean {
+    for (const state of this.states.values()) {
+      if (state.step.required && state.status !== 'completed') {
+        return false;
+      }
+      if (!state.step.required && state.status !== 'completed' && state.status !== 'skipped') {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  getOutputs(): Map<string, Record<string, unknown>> {
+    const outputs = new Map<string, Record<string, unknown>>();
+    for (const [name, state] of this.states) {
+      if (state.output) {
+        outputs.set(name, state.output);
+      }
+    }
+    return outputs;
+  }
+
+  private advanceNext(completedName: string): void {
+    const idx = this.ordered.findIndex((s) => s.name === completedName);
+    if (idx < this.ordered.length - 1) {
+      const next = this.ordered[idx + 1];
+      const nextState = this.states.get(next.name)!;
+      if (nextState.status === 'pending') {
+        nextState.status = 'available';
+      }
+    }
+  }
+}

package/src/step-tools.ts

@@ -0,0 +1,55 @@
+import type { StepRegistry } from './step-registry.js';
+
+export interface ToolLike {
+  name: string;
+  description: string;
+  parameters: Record<string, unknown>;
+  run(args: Record<string, unknown>): Promise<{ success: boolean; data: Record<string, unknown> }>;
+  getPermission(): string;
+}
+
+export class StepToolGenerator {
+  private readonly registry: StepRegistry;
+
+  constructor(registry: StepRegistry) {
+    this.registry = registry;
+  }
+
+  getCurrentTools(): ToolLike[] {
+    const step = this.registry.currentStep();
+    if (!step) {
+      return [];
+    }
+
+    const registry = this.registry;
+
+    return [
+      {
+        name: `reasoning_${step.name}`,
+        description: `[Reasoning Step ${step.order}] ${step.description}`,
+        parameters: {
+          type: 'object',
+          properties: {
+            result: { type: 'object' },
+          },
+        },
+        async run(args: Record<string, unknown>): Promise<{ success: boolean; data: Record<string, unknown> }> {
+          registry.complete(step.name, args);
+          const progress = registry.progress();
+          const nextStep = registry.currentStep();
+          return {
+            success: true,
+            data: {
+              step: step.name,
+              progress,
+              nextStep: nextStep?.name ?? null,
+            },
+          };
+        },
+        getPermission(): string {
+          return 'AUTO_APPROVE';
+        },
+      },
+    ];
+  }
+}

package/src/types.ts

@@ -0,0 +1,21 @@
+export interface ReasoningStep {
+  name: string;
+  description: string;
+  order: number;
+  required: boolean;
+}
+
+export type StepStatus = 'pending' | 'available' | 'completed' | 'skipped';
+
+export interface StepState {
+  step: ReasoningStep;
+  status: StepStatus;
+  output?: Record<string, unknown>;
+  completedAt?: number;
+}
+
+export interface StepProgress {
+  completed: number;
+  total: number;
+  percentage: number;
+}

package/tests/improvement-store.test.ts

@@ -0,0 +1,86 @@
+import { describe, it, expect, afterEach } from 'vitest';
+import { ImprovementStore } from '../src/improvement-store.js';
+import { mkdtempSync, rmSync } from 'node:fs';
+import { join } from 'node:path';
+import { tmpdir } from 'node:os';
+import type { ImprovementProposal } from '../src/improvement-types.js';
+
+describe('ImprovementStore', () => {
+  let store: ImprovementStore;
+  let tmpDir: string;
+
+  afterEach(() => {
+    store?.close();
+    if (tmpDir) rmSync(tmpDir, { recursive: true, force: true });
+  });
+
+  it('stores and retrieves proposals', () => {
+    tmpDir = mkdtempSync(join(tmpdir(), 'imp-'));
+    store = new ImprovementStore(join(tmpDir, 'improvements.db'));
+
+    const proposal: ImprovementProposal = {
+      observations: { accuracy: 0.85 },
+      reflections: { patterns: ['error on long inputs'] },
+      hypotheses: { proposals: [{ change: 'chunk inputs' }] },
+      validations: { testResults: [{ passed: true }] },
+      status: 'pending_review',
+      createdAt: Date.now(),
+    };
+
+    const id = store.record(proposal);
+    expect(id).toBeGreaterThan(0);
+
+    const retrieved = store.getById(id);
+    expect(retrieved).toBeDefined();
+    expect(retrieved!.status).toBe('pending_review');
+    expect(retrieved!.observations).toEqual({ accuracy: 0.85 });
+  });
+
+  it('updates proposal status', () => {
+    tmpDir = mkdtempSync(join(tmpdir(), 'imp-'));
+    store = new ImprovementStore(join(tmpDir, 'improvements.db'));
+
+    const id = store.record({
+      observations: {},
+      reflections: {},
+      hypotheses: {},
+      validations: {},
+      status: 'pending_review',
+      createdAt: Date.now(),
+    });
+
+    store.updateStatus(id, 'approved');
+    expect(store.getById(id)!.status).toBe('approved');
+
+    store.updateStatus(id, 'applied');
+    expect(store.getById(id)!.status).toBe('applied');
+  });
+
+  it('lists proposals by status', () => {
+    tmpDir = mkdtempSync(join(tmpdir(), 'imp-'));
+    store = new ImprovementStore(join(tmpDir, 'improvements.db'));
+
+    store.record({ observations: {}, reflections: {}, hypotheses: {}, validations: {}, status: 'pending_review', createdAt: 1000 });
+    store.record({ observations: {}, reflections: {}, hypotheses: {}, validations: {}, status: 'approved', createdAt: 2000 });
+    store.record({ observations: {}, reflections: {}, hypotheses: {}, validations: {}, status: 'pending_review', createdAt: 3000 });
+
+    const pending = store.getByStatus('pending_review');
+    expect(pending).toHaveLength(2);
+
+    const approved = store.getByStatus('approved');
+    expect(approved).toHaveLength(1);
+  });
+
+  it('returns recent proposals', () => {
+    tmpDir = mkdtempSync(join(tmpdir(), 'imp-'));
+    store = new ImprovementStore(join(tmpDir, 'improvements.db'));
+
+    for (let i = 0; i < 5; i++) {
+      store.record({ observations: { i }, reflections: {}, hypotheses: {}, validations: {}, status: 'pending_review', createdAt: i * 1000 });
+    }
+
+    const recent = store.getRecent(2);
+    expect(recent).toHaveLength(2);
+    expect((recent[0].observations as Record<string, number>).i).toBe(4);
+  });
+});

package/tests/meta-improvement.test.ts

@@ -0,0 +1,95 @@
+import { describe, it, expect } from 'vitest';
+import { MetaImprovementStructure } from '../src/meta-improvement.js';
+import type { ImprovementProposal } from '../src/improvement-types.js';
+
+describe('MetaImprovementStructure', () => {
+  it('creates a 4-step reasoning structure', () => {
+    const meta = new MetaImprovementStructure();
+    const progress = meta.getProgress();
+
+    expect(progress.total).toBe(4);
+    expect(progress.completed).toBe(0);
+    expect(meta.getCurrentStepName()).toBe('observe');
+  });
+
+  it('progresses through steps in order', () => {
+    const meta = new MetaImprovementStructure();
+
+    meta.completeStep('observe', {
+      metrics: { accuracy: 0.85, latency_p50: 200 },
+      anomalies: ['High error rate on code reviews'],
+    });
+    expect(meta.getCurrentStepName()).toBe('reflect');
+
+    meta.completeStep('reflect', {
+      patterns: ['Code review errors correlate with long inputs'],
+      rootCauses: ['Context window truncation on large diffs'],
+    });
+    expect(meta.getCurrentStepName()).toBe('hypothesize');
+
+    meta.completeStep('hypothesize', {
+      proposals: [
+        { change: 'Chunk large diffs before review', confidence: 0.8 },
+        { change: 'Increase context window budget', confidence: 0.6 },
+      ],
+    });
+    expect(meta.getCurrentStepName()).toBe('validate');
+  });
+
+  it('builds improvement proposal from step outputs', () => {
+    const meta = new MetaImprovementStructure();
+
+    meta.completeStep('observe', { metrics: { accuracy: 0.85 } });
+    meta.completeStep('reflect', { patterns: ['Error on long inputs'] });
+    meta.completeStep('hypothesize', {
+      proposals: [{ change: 'Chunk inputs', confidence: 0.8 }],
+    });
+    meta.completeStep('validate', {
+      testResults: [{ proposal: 'Chunk inputs', passed: true, improvement: 0.12 }],
+    });
+
+    expect(meta.isComplete()).toBe(true);
+    const proposal = meta.buildProposal();
+    expect(proposal).toBeDefined();
+    expect(proposal!.observations).toBeDefined();
+    expect(proposal!.reflections).toBeDefined();
+    expect(proposal!.hypotheses).toBeDefined();
+    expect(proposal!.validations).toBeDefined();
+    expect(proposal!.status).toBe('pending_review');
+  });
+
+  it('generates tools for the current step', () => {
+    const meta = new MetaImprovementStructure();
+    const tools = meta.getCurrentTools();
+
+    expect(tools).toHaveLength(1);
+    expect(tools[0].name).toContain('observe');
+  });
+
+  it('returns empty tools when all steps are complete', () => {
+    const meta = new MetaImprovementStructure();
+
+    meta.completeStep('observe', { metrics: {} });
+    meta.completeStep('reflect', { patterns: [] });
+    meta.completeStep('hypothesize', { proposals: [] });
+    meta.completeStep('validate', { testResults: [] });
+
+    const tools = meta.getCurrentTools();
+    expect(tools).toHaveLength(0);
+  });
+
+  it('rejects completing steps out of order', () => {
+    const meta = new MetaImprovementStructure();
+
+    expect(() => meta.completeStep('reflect', { patterns: [] })).toThrow();
+  });
+
+  it('provides step descriptions for LLM context', () => {
+    const meta = new MetaImprovementStructure();
+    const descriptions = meta.getStepDescriptions();
+
+    expect(descriptions).toHaveLength(4);
+    expect(descriptions[0].name).toBe('observe');
+    expect(descriptions[0].description).toBeTruthy();
+  });
+});

package/tests/step-registry.test.ts

@@ -0,0 +1,85 @@
+import { describe, it, expect } from 'vitest';
+import type { ReasoningStep } from '../src/types.js';
+import { StepRegistry } from '../src/step-registry.js';
+
+function makeSteps(): ReasoningStep[] {
+  return [
+    { name: 'analyze', description: 'Analyze the problem', order: 1, required: true },
+    { name: 'plan', description: 'Plan a solution', order: 2, required: true },
+    { name: 'validate', description: 'Validate the plan', order: 3, required: false },
+    { name: 'apply', description: 'Apply the solution', order: 4, required: true },
+  ];
+}
+
+describe('StepRegistry', () => {
+  it('tracks step completion in order', () => {
+    const registry = new StepRegistry(makeSteps());
+
+    expect(registry.currentStep()?.name).toBe('analyze');
+    registry.complete('analyze', { result: 'ok' });
+
+    expect(registry.currentStep()?.name).toBe('plan');
+    registry.complete('plan', { strategy: 'incremental' });
+
+    expect(registry.currentStep()?.name).toBe('validate');
+  });
+
+  it('allows skipping optional steps', () => {
+    const registry = new StepRegistry(makeSteps());
+
+    registry.complete('analyze');
+    registry.complete('plan');
+    expect(registry.canSkip('validate')).toBe(true);
+    registry.skip('validate');
+
+    expect(registry.currentStep()?.name).toBe('apply');
+  });
+
+  it('rejects out-of-order completion', () => {
+    const registry = new StepRegistry(makeSteps());
+
+    expect(() => registry.complete('plan')).toThrow(/not available/);
+  });
+
+  it('rejects skipping required steps', () => {
+    const registry = new StepRegistry(makeSteps());
+
+    expect(() => registry.skip('analyze')).toThrow(/required/);
+  });
+
+  it('reports overall progress', () => {
+    const registry = new StepRegistry(makeSteps());
+
+    registry.complete('analyze');
+    const progress = registry.progress();
+    expect(progress.completed).toBe(1);
+    expect(progress.total).toBe(4);
+    expect(progress.percentage).toBe(25);
+  });
+
+  it('reports completion when all required steps done', () => {
+    const registry = new StepRegistry(makeSteps());
+
+    expect(registry.isComplete()).toBe(false);
+    registry.complete('analyze');
+    registry.complete('plan');
+    registry.skip('validate');
+    registry.complete('apply');
+    expect(registry.isComplete()).toBe(true);
+  });
+
+  it('collects outputs from all completed steps', () => {
+    const registry = new StepRegistry(makeSteps());
+
+    registry.complete('analyze', { findings: ['a', 'b'] });
+    registry.complete('plan', { strategy: 'fast' });
+    registry.skip('validate');
+    registry.complete('apply', { applied: true });
+
+    const outputs = registry.getOutputs();
+    expect(outputs.size).toBe(3);
+    expect(outputs.get('analyze')).toEqual({ findings: ['a', 'b'] });
+    expect(outputs.get('plan')).toEqual({ strategy: 'fast' });
+    expect(outputs.get('apply')).toEqual({ applied: true });
+  });
+});

package/tests/step-tools.test.ts

@@ -0,0 +1,75 @@
+import { describe, it, expect } from 'vitest';
+import { StepRegistry } from '../src/step-registry.js';
+import { StepToolGenerator } from '../src/step-tools.js';
+import type { ReasoningStep } from '../src/types.js';
+
+function makeSteps(): ReasoningStep[] {
+  return [
+    { name: 'gather', description: 'Gather information', order: 1, required: true },
+    { name: 'analyze', description: 'Analyze data', order: 2, required: true },
+    { name: 'conclude', description: 'Draw conclusions', order: 3, required: true },
+  ];
+}
+
+describe('StepToolGenerator', () => {
+  it('generates tool for current step only', () => {
+    const registry = new StepRegistry(makeSteps());
+    const generator = new StepToolGenerator(registry);
+    const tools = generator.getCurrentTools();
+
+    expect(tools).toHaveLength(1);
+    expect(tools[0].name).toBe('reasoning_gather');
+    expect(tools[0].description).toBe('[Reasoning Step 1] Gather information');
+  });
+
+  it('tool invocation completes step and advances', async () => {
+    const registry = new StepRegistry(makeSteps());
+    const generator = new StepToolGenerator(registry);
+
+    const tools = generator.getCurrentTools();
+    await tools[0].run({ result: 'done' });
+
+    const nextTools = generator.getCurrentTools();
+    expect(nextTools).toHaveLength(1);
+    expect(nextTools[0].name).toBe('reasoning_analyze');
+  });
+
+  it('returns empty tools when all steps complete', async () => {
+    const registry = new StepRegistry(makeSteps());
+    const generator = new StepToolGenerator(registry);
+
+    // Complete all three steps sequentially
+    let tools = generator.getCurrentTools();
+    await tools[0].run({ result: 'gathered' });
+
+    tools = generator.getCurrentTools();
+    await tools[0].run({ result: 'analyzed' });
+
+    tools = generator.getCurrentTools();
+    await tools[0].run({ result: 'concluded' });
+
+    const finalTools = generator.getCurrentTools();
+    expect(finalTools).toHaveLength(0);
+  });
+
+  it('tool has AUTO_APPROVE permission', () => {
+    const registry = new StepRegistry(makeSteps());
+    const generator = new StepToolGenerator(registry);
+    const tools = generator.getCurrentTools();
+
+    expect(tools[0].getPermission()).toBe('AUTO_APPROVE');
+  });
+
+  it('includes progress in tool result', async () => {
+    const registry = new StepRegistry(makeSteps());
+    const generator = new StepToolGenerator(registry);
+
+    const tools = generator.getCurrentTools();
+    const result = await tools[0].run({ result: 'gathered' });
+
+    expect(result.success).toBe(true);
+    expect(result.data.progress).toEqual({ completed: 1, total: 3, percentage: 33 });
+    expect(result.data.step).toBe('gather');
+    expect(result.data.nextStep).toBe('analyze');
+  });
+});

package/tsconfig.json

@@ -0,0 +1,5 @@
+{
+  "extends": "../../tsconfig.json",
+  "compilerOptions": { "rootDir": "src", "outDir": "dist" },
+  "include": ["src"]
+}