{
  "capability_id": "math.prime_factorization",
  "tool_id": "prime-factorization",
  "engine": "prime-factorization",
  "calculation_version": "1.0.1",
  "generated_at": "2026-10-29T17:04:55.746Z",
  "engine_build": "2026-10-23",
  "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": [
    "1<=n<=10^12; integer strings at most13 digits and512 characters, or safe JSON integers. Exactness starts at the normalized integer.",
    "n=1 has empty factors and is neither prime nor composite. Factors are sorted ascending; ω counts distinct primes and Ω counts multiplicity.",
    "Trial division bounded by sqrt(n); no floating convergence or cryptographic-size factorization service. Primality is a view of the complete factorization.",
    "Unknown keys, alias conflicts and invalid types reject. Share links execute the current engine. JSON numeric source follows the general binary64 transport policy; use digit strings for exact source input."
  ],
  "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:b829da98c174e8e44f50bfa4a0125a9c3ce0f092ab89b9f50354ed9f72f90252",
  "tier": "engine_tested",
  "verification": {
    "tests": {
      "passed": 11,
      "total": 11,
      "golden": 3,
      "boundary": 2,
      "property": 6
    },
    "contract_checks": {
      "passed": 6,
      "total": 6
    }
  },
  "evidence_core_generated_at": "2026-10-23T01:26:27.414Z",
  "rendered_at": "2026-10-29T17:04:55.746Z",
  "release_integrity": {
    "status": "verified",
    "scope": "workspace",
    "production_attestation_required": true,
    "calculation_version": "1.0.1",
    "artifacts": {
      "engine": "1.0.1",
      "page": "1.0.1",
      "capability": "1.0.1",
      "evidence": "1.0.1",
      "input_schema": "1.0.1",
      "output_schema": "1.0.1",
      "mcp_contract": "1.0.1"
    },
    "digests": {
      "input_schema_sha256": "99609a1ee80f23d3800871c8cca1f0b5875203bf88dd49bc39bb4948e6833544",
      "output_schema_sha256": "b07a4605ef4dc94b608e7b0ffd20935d4b31e722999e7af449aaa8acad203955",
      "evidence_sha256": "af33937dd860d2da31cc7b02e688cc45dc42bf18f635ce3ddd57b179a16dcd26",
      "evidence_core_sha256": "af33937dd860d2da31cc7b02e688cc45dc42bf18f635ce3ddd57b179a16dcd26",
      "capability_sha256": "2b359ceb313cfef7c397f0345a210685ddd6362ae227f3d8a08e4bb37deac9b5",
      "engine_sha256": "c6ebd8436f08b413e1ac6317b2d48550f2e6639a90dff254244e3aa562158b8d",
      "mcp_contract_sha256": "1cafec71298a0deb89bd361494db4322a690d14b61e801243407475112bdacbd"
    },
    "contract_checks": {
      "total": 6,
      "passed": 6,
      "failed": 0,
      "items": [
        {
          "id": "release-artifacts-aligned",
          "status": "pass",
          "detail": "1.0.1"
        },
        {
          "id": "schema-output-required-declared",
          "status": "pass"
        },
        {
          "id": "schema-valid-input-executes",
          "status": "pass"
        },
        {
          "id": "engine-success-output-validates-schema",
          "status": "pass"
        },
        {
          "id": "schema-rejects-incomplete-input",
          "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"
  }
}
