@vela-science/canopus 0.6.5 → 0.8.0

package/advisories/erdos1056-claim-fidelity/registration.json

@@ -1,42 +0,0 @@
-{
-  "schema": "canopus.claim-fidelity-registration.v1",
-  "id": "erdos1056-run-eb6b-claim-fidelity-gpt56",
-  "model": "gpt-5.6-sol",
-  "reasoning_effort": "high",
-  "external_gate_credit": false,
-  "source": {
-    "repository": "https://github.com/vela-science/erdos-frontier",
-    "commit": "807f0a8f770cfed05ac0dff00b952dc41052a720",
-    "run_id": "run_eb6bcd46-cffd-4ae8-b630-2681bd84da71",
-    "artifact_path": "artifacts/erdos1056-k15-range-10428401-10428600.txt",
-    "artifact_root": "sha256:79370d5243095f28e65c218f3d5dc4710802e4dbe462fcfff1a35a8697a6f225",
-    "roots": {
-      "actor_registry": "sha256:665f3e1c48f0a50fac949681c0af01bdd28de2991f2cdc5cc4cddbe69df6311b",
-      "artifacts": "sha256:3d58619c5cfb7e28de2f344476e35c9f0b80709c996b2a1bfdb2e11496f7e1da",
-      "event_log": "sha256:a06797bc0d1b0e3c88a2f97507fe0832661e3992d8df41187a0aa6d3ceee9bde",
-      "proposals": "sha256:e69b38037814f2e8ca826942cfc50ab370993889be2913cac1c0b3e77711160f",
-      "snapshot": "sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56"
-    },
-    "reported_claim": "Exhaustive registered search over primes in 10428401..10428600 completed with a bounded negative result; the maximum factorial-residue fiber multiplicity found was 12 at p=10428581, residue=5141590.",
-    "reported_metrics": {
-      "range_start": 10428401,
-      "range_end": 10428600,
-      "primes_tested": 15,
-      "max_multiplicity": 12,
-      "best_p": 10428581,
-      "best_residue": 5141590
-    },
-    "verifier_status": "passed",
-    "receipt_root": "sha256:263506aae0144fb2aa4784ff9c145c6c41886b2956191c6458214cedd0bfd4aa",
-    "policy_route": "defer",
-    "accepted_state_delta": 0
-  },
-  "output_schema": "advisories/erdos1056-claim-fidelity/output.schema.json",
-  "output_schema_sha256": "sha256:874c61b6fbd44a2bcb68cde8b5a9a89b74f6d00f3d9a9723cb67c682bd64e045",
-  "runner": {
-    "codex_version": "codex-cli 0.144.6",
-    "timeout_ms": 180000,
-    "max_output_bytes": 1048576,
-    "maximum_model_calls": 1
-  }
-}

package/advisories/erdos1056-claim-fidelity/results/assessment.json

@@ -1 +0,0 @@
-{"language":{"classification":"model_assessment","flagged_phrases":[],"rationale":"The claim explicitly limits the exhaustive search and negative result to primes in the bounded range 10428401..10428600 and does not state or imply that the Erdős problem is solved.","solved_language_detected":false,"universal_claim_detected":false},"numeric_correspondence":{"best_p":{"artifact":10428581,"matches":true,"reported":10428581},"best_residue":{"artifact":5141590,"matches":true,"reported":5141590},"max_multiplicity":{"artifact":12,"matches":true,"reported":12},"primes_tested":{"artifact":15,"matches":true,"reported":15},"range_end":{"artifact":10428600,"matches":true,"reported":10428600},"range_start":{"artifact":10428401,"matches":true,"reported":10428401}},"recommendation":{"classification":"model_assessment","publishable_with_caveats":true,"revised_claim":"Exhaustive registered search over primes in 10428401..10428600 completed with a bounded negative result; the maximum factorial-residue fiber multiplicity found was 12 at p=10428581, residue=5141590. This bounded verifier-passed result does not solve the Erdős problem and has not been scientifically accepted."},"schema":"canopus.claim-fidelity-assessment.v1","source":{"artifact_root":"sha256:79370d5243095f28e65c218f3d5dc4710802e4dbe462fcfff1a35a8697a6f225","reported_claim":"Exhaustive registered search over primes in 10428401..10428600 completed with a bounded negative result; the maximum factorial-residue fiber multiplicity found was 12 at p=10428581, residue=5141590.","roots":{"actor_registry":"sha256:665f3e1c48f0a50fac949681c0af01bdd28de2991f2cdc5cc4cddbe69df6311b","artifacts":"sha256:3d58619c5cfb7e28de2f344476e35c9f0b80709c996b2a1bfdb2e11496f7e1da","event_log":"sha256:a06797bc0d1b0e3c88a2f97507fe0832661e3992d8df41187a0aa6d3ceee9bde","proposals":"sha256:e69b38037814f2e8ca826942cfc50ab370993889be2913cac1c0b3e77711160f","snapshot":"sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56"},"run_id":"run_eb6bcd46-cffd-4ae8-b630-2681bd84da71"},"standing":{"accepted_state_delta":0,"distinction":"The recorded verifier pass confirms verification of the registered bounded run; it does not constitute scientific acceptance, change accepted scientific state, or make this advisory itself scientific state.","policy_route":"defer","scientific_acceptance_reported":false,"verifier_success_reported":true}}

package/advisories/erdos1056-claim-fidelity/results/verification.json

@@ -1 +0,0 @@
-{"assessment_root":"sha256:9205390df001a428b4b3e2fbb0a855e9f1061754b3f87771a85fc7328824ed1f","authority":"non_authoritative_advisory","checks":{"all_five_roots_bound":true,"artifact_root_matched":true,"numeric_correspondence_matched":true,"source_run_bound":true,"verifier_acceptance_distinction_preserved":true},"events_root":"sha256:e412c39b92fe210531e1fa7749fc036d780ee9016292bc5052e0e11a17b7c79e","model":"gpt-5.6-sol","output_schema_root":"sha256:874c61b6fbd44a2bcb68cde8b5a9a89b74f6d00f3d9a9723cb67c682bd64e045","registration_root":"sha256:371390871e1a371207e3de797e45989e84bbb766e07afdab5d47fdb3536f2c1b","schema":"canopus.claim-fidelity-verification.v1","scientific_state_landed":false,"semantic_fields":[{"classification":"model_assessment","path":"language"},{"classification":"model_assessment","path":"recommendation"}],"status":"pass","stderr_root":"sha256:98309d91d149b3bc4682df22c8c9a3d227c9c8506a89b90de32c3f55594e539e","usage":{"cached_input_tokens":0,"input_tokens":9309,"output_tokens":795,"reasoning_output_tokens":74}}

package/capsules/formal-erdos-505-test-dim-one/verifier

@@ -1,105 +0,0 @@
-#!/bin/sh
-set -eu
-
-if [ "$#" -ne 1 ]; then
-  echo "usage: verifier <proof-term>" >&2
-  exit 2
-fi
-
-proof=$1
-if [ ! -f "$proof" ] || [ -L "$proof" ]; then
-  echo "proof artifact must be one regular file" >&2
-  exit 2
-fi
-
-size=$(wc -c < "$proof" | tr -d ' ')
-if [ "$size" -eq 0 ] || [ "$size" -gt 131072 ]; then
-  echo "proof artifact must contain 1..131072 bytes" >&2
-  exit 2
-fi
-
-if [ "$(head -c 2 "$proof")" != "by" ]; then
-  echo "proof artifact must begin with a Lean 'by' term" >&2
-  exit 2
-fi
-
-if LC_ALL=C grep -Eq '(^|[^A-Za-z0-9_])(sorry|admit|axiom|unsafe)([^A-Za-z0-9_]|$)' "$proof"; then
-  echo "proof artifact contains a forbidden trust-bypassing token" >&2
-  exit 2
-fi
-
-toolchain=/home/lean/.elan/toolchains/leanprover--lean4---v4.27.0/bin
-project=/home/lean/mathlib
-if [ ! -x "$toolchain/lean" ]; then
-  echo "frozen Lean 4.27.0 toolchain is unavailable" >&2
-  exit 3
-fi
-if [ ! -f "$project/.lake/build/lib/lean/Mathlib/Analysis/InnerProductSpace/PiL2.olean" ] \
-    || [ ! -f "$project/.lake/build/lib/lean/Mathlib/Topology/MetricSpace/Bounded.olean" ]; then
-  echo "frozen minimal Mathlib modules are unavailable" >&2
-  exit 3
-fi
-
-export PATH="$toolchain:/usr/local/bin:/usr/bin:/bin"
-export LC_ALL=C
-LEAN_PATH=$(
-  find "$project" -type d -path '*/.lake/build/lib/lean' -print \
-    | LC_ALL=C sort \
-    | paste -sd ':' -
-)
-if [ -z "$LEAN_PATH" ]; then
-  echo "frozen Mathlib module path is unavailable" >&2
-  exit 3
-fi
-export LEAN_PATH
-cd "$project"
-
-set +e
-output=$(
-  {
-    printf '%s\n' \
-      'import Mathlib.Analysis.InnerProductSpace.PiL2' \
-      'import Mathlib.Topology.MetricSpace.Bounded' \
-      '/-! # Frozen Canopus verification for Erdos 505, dimension one -/' \
-      'open Metric Set Classical' \
-      'namespace CanopusFormalErdos505' \
-      'theorem test_dim_one' \
-      '    (S : Set (EuclideanSpace ℝ (Fin 1)))' \
-      '    (hS : Bornology.IsBounded S) (hd : 0 < diam S) :' \
-      '    ∃ (F : Fin 2 → Set (EuclideanSpace ℝ (Fin 1))),' \
-      '      S ⊆ ⋃ i, F i ∧ ∀ i, diam (F i) < diam S :='
-    cat "$proof"
-    printf '%s\n' \
-      '#print axioms CanopusFormalErdos505.test_dim_one' \
-      'end CanopusFormalErdos505'
-  } | "$toolchain/lean" --stdin 2>&1
-)
-status=$?
-set -e
-
-printf '%s\n' "$output"
-if [ "$status" -ne 0 ]; then
-  exit "$status"
-fi
-if printf '%s\n' "$output" | grep -Fq 'sorryAx'; then
-  echo "kernel declaration depends on sorryAx" >&2
-  exit 4
-fi
-
-axiom_line=$(printf '%s\n' "$output" | sed -n "s/^'CanopusFormalErdos505.test_dim_one' depends on axioms: \[\(.*\)\]$/\1/p")
-if [ -n "$axiom_line" ]; then
-  for axiom in $(printf '%s' "$axiom_line" | tr ',' ' '); do
-    case "$axiom" in
-      propext|Classical.choice|Quot.sound) ;;
-      *)
-        echo "kernel declaration depends on forbidden axiom: $axiom" >&2
-        exit 4
-        ;;
-    esac
-  done
-elif ! printf '%s\n' "$output" | grep -Fq "'CanopusFormalErdos505.test_dim_one' does not depend on any axioms"; then
-  echo "axiom audit output was missing or malformed" >&2
-  exit 4
-fi
-
-echo "verified formal:erdos-505-test-dim-one with Lean 4.27.0"

package/capsules/quantum-10-1-4/verifier.py

@@ -1,152 +0,0 @@
-#!/usr/bin/env python3
-"""Verify one explicit [[10,1,d>=4]] stabilizer witness."""
-
-from __future__ import annotations
-
-import itertools
-import json
-import pathlib
-import sys
-
-SCHEMA = "canopus.quantum-stabilizer-witness.v1"
-TARGET = "quantum:[[10,1,4]]"
-N = 10
-K = 1
-EXPECTED_KEYS = {"schema", "target", "n", "k", "generators"}
-
-
-def fail(message: str) -> "NoReturn":
-    print(f"quantum verifier: {message}", file=sys.stderr)
-    raise SystemExit(1)
-
-
-def pauli_vector(pauli: str) -> int:
-    if len(pauli) != N or any(symbol not in "IXYZ" for symbol in pauli):
-        fail("each generator must be a length-10 string over I, X, Y, Z")
-    vector = 0
-    for qubit, symbol in enumerate(pauli):
-        if symbol in "XY":
-            vector |= 1 << qubit
-        if symbol in "ZY":
-            vector |= 1 << (N + qubit)
-    return vector
-
-
-def symplectic(left: int, right: int) -> int:
-    mask = (1 << N) - 1
-    left_x, left_z = left & mask, left >> N
-    right_x, right_z = right & mask, right >> N
-    return ((left_x & right_z).bit_count() + (left_z & right_x).bit_count()) & 1
-
-
-def binary_rank(rows: list[int]) -> int:
-    basis: dict[int, int] = {}
-    for original in rows:
-        row = original
-        while row:
-            pivot = row.bit_length() - 1
-            if pivot in basis:
-                row ^= basis[pivot]
-            else:
-                basis[pivot] = row
-                break
-    return len(basis)
-
-
-def stabilizer_span(generators: list[int]) -> set[int]:
-    span = {0}
-    for generator in generators:
-        span.update(value ^ generator for value in tuple(span))
-    return span
-
-
-def error_vector(positions: tuple[int, ...], symbols: tuple[str, ...]) -> int:
-    vector = 0
-    for qubit, symbol in zip(positions, symbols, strict=True):
-        if symbol in "XY":
-            vector |= 1 << qubit
-        if symbol in "ZY":
-            vector |= 1 << (N + qubit)
-    return vector
-
-
-def main() -> None:
-    if len(sys.argv) != 2:
-        fail("usage: verifier.py WITNESS.json")
-    witness_path = pathlib.Path(sys.argv[1])
-    metadata = witness_path.lstat()
-    if not witness_path.is_file() or witness_path.is_symlink() or metadata.st_size > 65_536:
-        fail("witness must be one bounded regular file")
-    with witness_path.open("rb") as source:
-        raw = source.read(65_537)
-    if len(raw) > 65_536:
-        fail("witness exceeds 65536 bytes")
-    try:
-        witness = json.loads(raw)
-    except (UnicodeDecodeError, json.JSONDecodeError) as error:
-        fail(f"witness is not valid UTF-8 JSON: {error}")
-    if not isinstance(witness, dict) or set(witness) != EXPECTED_KEYS:
-        fail("witness fields must be exactly schema, target, n, k, generators")
-    if witness["schema"] != SCHEMA or witness["target"] != TARGET:
-        fail("witness schema or target is wrong")
-    if type(witness["n"]) is not int or type(witness["k"]) is not int:
-        fail("n and k must be integers")
-    if witness["n"] != N or witness["k"] != K:
-        fail("witness must declare n=10 and k=1")
-    declared = witness["generators"]
-    if not isinstance(declared, list) or len(declared) != N - K:
-        fail("witness must contain exactly nine generators")
-    if any(not isinstance(generator, str) for generator in declared):
-        fail("every generator must be a string")
-    if len(set(declared)) != len(declared):
-        fail("generators must be distinct")
-    generators = [pauli_vector(generator) for generator in declared]
-    if any(generator == 0 for generator in generators):
-        fail("identity is not a generator")
-    for left, right in itertools.combinations(generators, 2):
-        if symplectic(left, right) != 0:
-            fail("generators do not commute")
-    rank = binary_rank(generators)
-    if rank != N - K:
-        fail(f"generator rank is {rank}, expected nine")
-    span = stabilizer_span(generators)
-    if len(span) != 1 << (N - K):
-        fail("stabilizer span has the wrong cardinality")
-
-    tested = 0
-    degenerate = 0
-    for weight in range(1, 4):
-        for positions in itertools.combinations(range(N), weight):
-            for symbols in itertools.product("XYZ", repeat=weight):
-                tested += 1
-                error = error_vector(positions, symbols)
-                if all(symplectic(error, generator) == 0 for generator in generators):
-                    if error not in span:
-                        fail(
-                            "found an undetectable non-stabilizer Pauli below weight four: "
-                            f"positions={positions}, symbols={''.join(symbols)}"
-                        )
-                    degenerate += 1
-    if tested != 3_675:
-        fail(f"internal enumeration count is {tested}, expected 3675")
-    print(
-        json.dumps(
-            {
-                "schema": "canopus.quantum-stabilizer-verification.v1",
-                "target": TARGET,
-                "n": N,
-                "k": K,
-                "rank": rank,
-                "stabilizer_size": len(span),
-                "errors_weight_1_to_3_tested": tested,
-                "low_weight_stabilizers": degenerate,
-                "distance_at_least": 4,
-            },
-            sort_keys=True,
-            separators=(",", ":"),
-        )
-    )
-
-
-if __name__ == "__main__":
-    main()

package/dist/src/capability/withdrawal.d.ts

@@ -1,47 +0,0 @@
-import type { Mission, MissionRoots, StrictBaseline } from "../contracts/mission.js";
-import type { LandResult } from "../vela/types.js";
-export declare const WITHDRAWAL_CAPABILITY_SCHEMA: "canopus.withdrawal-capability.v1";
-export interface WithdrawalCapabilityManifest {
-    schema: typeof WITHDRAWAL_CAPABILITY_SCHEMA;
-    state: "available" | "consumed";
-    proposal_id: string;
-    proposal_root: string;
-    receipt_root: string;
-    identity_binding_id: string;
-    actor: string;
-    public_key: string;
-    frontier: string;
-    final_roots: MissionRoots;
-    strict_baseline: StrictBaseline;
-    vela: {
-        binary: string;
-        version: string;
-        sha256: string;
-    };
-    created_at: string;
-    consumed_at?: string;
-    consumed_reason?: "withdrawn" | "human_decision_observed";
-}
-export declare function capabilityDirectory(proposalId: string, storeRoot?: string): string;
-export declare function retainWithdrawalCapability(options: {
-    velaHome: string;
-    landingRepo: string;
-    mission: Mission;
-    landing: LandResult;
-    finalRoots: MissionRoots;
-    velaBinary: string;
-    storeRoot?: string;
-}): Promise<{
-    directory: string;
-    manifest: WithdrawalCapabilityManifest;
-    manifest_root: string;
-}>;
-export declare function loadWithdrawalCapability(proposalId: string, storeRoot?: string): Promise<{
-    directory: string;
-    manifest: WithdrawalCapabilityManifest;
-    manifest_root: string;
-    secret_available: boolean;
-}>;
-export declare function installWithdrawalCapabilitySecret(proposalId: string, target: string, storeRoot?: string): Promise<void>;
-export declare function withdrawalCapabilityStatus(proposalId: string, storeRoot?: string): Promise<Record<string, unknown>>;
-export declare function consumeWithdrawalCapability(proposalId: string, reason: "withdrawn" | "human_decision_observed", storeRoot?: string): Promise<WithdrawalCapabilityManifest>;