amalgm 0.1.219 → 0.1.220

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "amalgm",
-  "version": "0.1.219",
+  "version": "0.1.220",
   "description": "Amalgm local computer runtime: login, MCP, chat, events, previews, and tunnels.",
   "license": "UNLICENSED",
   "private": false,

package/runtime/scripts/amalgm-mcp/tests/workspace-reducer.test.js

@@ -176,6 +176,46 @@ test('a checkpoint base replaces covered history and keeps only newer mutations'
   assert.equal(reduced.checkpointRevision, revisionOf(oid, patchAB, ''));
 });
 
+test('an unfinished checkpoint base cannot replace the last complete base', () => {
+  const oid = 'a'.repeat(40);
+  const complete = card('/complete', oid, 1);
+  complete.checkpointBase = {
+    checkpoint: CHECKPOINT_CONTRACT,
+    baseOid: oid,
+    branch: 'main',
+    through: 4,
+    value: value(oid, 'complete-patch'),
+  };
+  complete.checkpoints = [
+    transition('machine-a', 5, oid, 'complete-patch', 'later-patch'),
+  ];
+
+  const unfinished = card('/unfinished', oid, 1);
+  unfinished.checkpointBase = {
+    checkpoint: CHECKPOINT_CONTRACT,
+    baseOid: oid,
+    branch: 'main',
+    through: 6,
+    value: {
+      revision: 'b'.repeat(64),
+      payload: {
+        kind: 'pending',
+        contract: 'opaque-chunks@1',
+        checksum: 'c'.repeat(64),
+      },
+    },
+  };
+
+  const plan = reduceWall([
+    { machine: 'machine-a', cards: [complete] },
+    { machine: 'machine-b', cards: [unfinished] },
+  ]).get('root:test');
+
+  assert.equal(plan.checkpointBase.through, 4);
+  assert.equal(plan.checkpointBaseConflict, false);
+  assert.deepEqual(plan.transitions.map((entry) => entry.version), [5]);
+});
+
 test('different snapshots claiming the same rail position stop instead of choosing a winner', () => {
   const oid = 'a'.repeat(40);
   const first = card('/first', oid, 1);

package/runtime/scripts/amalgm-mcp/tests/workspace-wall.test.js

@@ -453,6 +453,20 @@ test('a checkpoint base replaces history already covered by the applied rail', a
   assert.deepEqual(settleProject(), [3]);
 });
 
+test('an uploading checkpoint base is not announced as complete', () => {
+  const card = readWall(repoKey)[0].cards[0];
+  const [stamped] = stampCards([card], [], { card, branches: [], transitions: [] }, {
+    repoKey,
+    baseOid: card.head.oid,
+    branch: card.head.branch,
+    appliedThrough: 3,
+    indexDiff: 'x'.repeat(600 * 1024),
+    worktreeDiff: '',
+  }, 'mut_project_pending_base', project);
+
+  assert.equal(stamped.checkpointBase, undefined);
+});
+
 test('one failed project publisher cannot block the next repo', () => {
   const selected = [{ repoKey: 'root:first' }, { repoKey: 'root:second' }];
   const calls = [];

package/runtime/scripts/amalgm-mcp/workspace/reducer.js

@@ -153,6 +153,7 @@ function reduceWall(entries) {
       .filter((entry) => (
         entry.baseOid === repo.card.head?.oid
         && entry.branch === repo.card.head?.branch
+        && checkpointValueReady(entry.value)
       ))
       .sort((left, right) => right.through - left.through);
     const newestThrough = matchingBases[0]?.through ?? null;

package/runtime/scripts/amalgm-mcp/workspace/wall.js

@@ -20,6 +20,7 @@ const { listRepoCards } = require('./cards');
 const {
   CHECKPOINT_CONTRACT,
   checkpointValue,
+  checkpointValueReady,
   readCheckpoint,
   repoKeyOfCard,
   sameTransition,
@@ -331,6 +332,7 @@ function checkpointBaseFor(card, baseline, project, shared = null) {
     baseline.indexDiff || '',
     baseline.worktreeDiff || '',
   );
+  if (!checkpointValueReady(value)) return null;
   const reusableThrough = shared
     && shared.baseOid === card.head.oid
     && shared.branch === card.head.branch