{
  "capability_id": "math.prime_factorization",
  "tool_id": "prime-factorization",
  "engine": "prime-factorization",
  "calculation_version": "1.0.0",
  "generated_at": "2026-10-22T14:07:51.535Z",
  "engine_build": "2026-10-14",
  "test_count": 11,
  "passed": 11,
  "failed": 0,
  "tests_summary": {
    "golden": {
      "passed": 3,
      "total": 3
    },
    "boundary": {
      "passed": 2,
      "total": 2
    },
    "property": {
      "passed": 6,
      "total": 6
    }
  },
  "engine_tested": true,
  "expert_reviewed": false,
  "internally_reviewed": false,
  "review_kind": null,
  "source_checked": true,
  "reviewed_by": null,
  "reviewer_role": null,
  "last_reviewed": null,
  "expert_review": {
    "status": "optional_not_performed",
    "reviewer": null,
    "scope": [
      "formula",
      "input semantics",
      "assumptions",
      "limitations",
      "sources",
      "tests"
    ],
    "note": "Domain expert review is optional under CVP (CVP-EXP-01). Absence does not block CVP Verified. See Review policy for supplemental domain assurance."
  },
  "internal_review": {
    "status": "not_applicable",
    "reviewer": null
  },
  "page": "https://www.calculatorx.com/calc/math/prime-factorization",
  "api": "https://www.calculatorx.com/api/v1/calc/prime-factorization",
  "schema_input": "https://www.calculatorx.com/schemas/math.prime_factorization.input.json",
  "schema_output": "https://www.calculatorx.com/schemas/math.prime_factorization.output.json",
  "assumptions": [
    "Unique factorization (fundamental theorem of arithmetic)",
    "Trial division",
    "n = 1 is neither prime nor composite"
  ],
  "limitations": [
    "Trial division only — not a primality-proving sieve for cryptographic sizes",
    "n = 1 is neither prime nor composite (empty factorization)",
    "Domain 1 ≤ n ≤ 10^12",
    "n < 1 → VALUE_MUST_BE_POSITIVE",
    "unknown mode → INVALID_MODE"
  ],
  "boundary_conditions": [
    "missing n → MISSING_REQUIRED_INPUT",
    "n < 1 → VALUE_MUST_BE_POSITIVE",
    "n > 10^12 → VALUE_ABOVE_MAX",
    "unknown mode → INVALID_MODE"
  ],
  "sources": [
    {
      "title": "ISO 80000-2:2019 Quantities and units — Mathematics (primes / factorization)",
      "url": "https://www.iso.org/standard/64973.html",
      "supports": "Mathematical symbols and notation. This standard is not numerical verification or an endorsement of this implementation.",
      "kind": "standard",
      "publisher": "International Organization for Standardization"
    },
    "Fundamental theorem of arithmetic",
    {
      "title": "MIT Mathematics for Computer Science — Chapter 8: Number Theory",
      "section": "Chapter 8, including sections 8.2–8.9 and problem 8.24",
      "url": "https://ocw.mit.edu/courses/6-042j-mathematics-for-computer-science-spring-2015/mit6_042js15_textbook.pdf",
      "supports": "Divisibility, prime factorization, gcd and the Euclidean algorithm, lcm via prime exponents, division with remainder, modular congruence and multiplicative inverses. CalculatorX’s signed-remainder and zero-input policies are stated separately on the page. Mathematical reference only; not validation or endorsement of this implementation.",
      "kind": "reference",
      "publisher": "Massachusetts Institute of Technology"
    }
  ],
  "methods": [],
  "fingerprint": "sha256:b89c30b7ff14bba3f4754488b02426f6bed77fbe3e83717d726c89b4d580672e",
  "tier": "engine_tested",
  "verification": {
    "tests": {
      "passed": 11,
      "total": 11,
      "golden": 3,
      "boundary": 2,
      "property": 6
    },
    "contract_checks": {
      "passed": 5,
      "total": 5
    }
  },
  "evidence_core_generated_at": "2026-10-14T04:17:16.233Z",
  "rendered_at": "2026-10-22T14:07:51.535Z",
  "release_integrity": {
    "status": "verified",
    "scope": "workspace",
    "production_attestation_required": true,
    "calculation_version": "1.0.0",
    "artifacts": {
      "engine": "1.0.0",
      "page": "1.0.0",
      "capability": "1.0.0",
      "evidence": "1.0.0",
      "input_schema": "1.0.0",
      "output_schema": "1.0.0",
      "mcp_contract": "1.0.0"
    },
    "digests": {
      "input_schema_sha256": "87cce1a3541796472731ab489ebec577a891fa572e053d23bc4123c56d289420",
      "output_schema_sha256": "03cb63458fd0dc6ded0829e175d96b9c62c227a6e33a5ffed917dde071a6145f",
      "evidence_sha256": "73304fdf9466fbb3fde9ec4fd6e88c1528daff2549364e22427ad8dce0de42a2",
      "evidence_core_sha256": "73304fdf9466fbb3fde9ec4fd6e88c1528daff2549364e22427ad8dce0de42a2",
      "capability_sha256": "a4fa5abe71ce6367343b3ba3506a8b3297e057018e0f3ff4b19b1fa4c7afa1bc",
      "engine_sha256": "a664ae25cd2134de7de43a99352933043215473589aec38c9416508150cb1008",
      "mcp_contract_sha256": "9fb774be45c579977f74d0b9ba1b614716eb273e6adac98725f4627cced5db21"
    },
    "contract_checks": {
      "total": 5,
      "passed": 5,
      "failed": 0,
      "items": [
        {
          "id": "release-artifacts-aligned",
          "status": "pass",
          "detail": "1.0.0"
        },
        {
          "id": "schema-output-required-declared",
          "status": "pass"
        },
        {
          "id": "schema-valid-input-executes",
          "status": "pass"
        },
        {
          "id": "engine-success-output-validates-schema",
          "status": "pass"
        },
        {
          "id": "rest-success-payload-validates-schema",
          "status": "pass"
        }
      ]
    },
    "report": "https://www.calculatorx.com/.well-known/calculatorx-release-integrity.json"
  },
  "tests": [],
  "disclosure": {
    "policy": "calculatorx-public-evidence-v1",
    "full_validation": "private",
    "representation": "summary"
  }
}