{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "pollard-rho-factorization-1975",
    "title": "Pollard: finding integer factors with a short collision search",
    "summary": "Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model.\n\nFactoring an integer by trying possible divisors can require many arithmetic operations. Pollard’s 1975 note proposed generating a sequence from a simple polynomial modulo the integer. When this sequence repeats modulo an unknown factor, a greatest-common-divisor calculation can reveal that factor without storing the whole sequence. The original method keeps only a few multi-length variables and combines several differences before computing a gcd. Its speed estimate relies explicitly on treating the induced mapping as random; this is not a worst-case guarantee for every polynomial or input. A gcd can also equal the whole integer, leaving no proper factor to extract, and a finite search can stop without finding anything. The note is therefore a practical search method rather than a universal fast, complete factorization theorem. Pollard’s earlier work and Knuth’s random-mapping ideas retain credit. The 1978 discrete-logarithm methods and Brent’s later improvements are separate contributions.",
    "boundary": "The method uses modular iteration and cycle/collision structure to seek a factor. Its expected behavior depends on heuristic randomness and the factor size; it is not a deterministic polynomial-time factorization guarantee. Failed runs may require changing parameters and do not prove primality. Later improvements and computational records retain separate credit.",
    "area": "Computational number theory",
    "topic": "Integer factorization",
    "year": 1975,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "pollard-rho-factorization-1975",
    "target": {
      "record_id": "urn:uuid:03af491b-5d83-43eb-af66-8f015323f4d5",
      "version": 1,
      "content_hash": "sha256:cfae20c7239c2dc9233aa7a2087495182f865b64f0669a48f138cec842fc080f"
    },
    "humans": [
      "J. M. Pollard"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "shor-algorithm"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-pollard1975-factorization-original",
        "title": "Pollard,AMonteCarloMethodforFactorization,BIT15(3),331-334(1975),original4pagejournal",
        "url": "https://pages.cs.wisc.edu/~cs812-1/pollardrho.pdf"
      },
      {
        "id": "wrs24-pollard1975-publisher-metadata",
        "title": "PublisherCrossrefdepositfor10.1007/BF01933667",
        "url": "https://api.crossref.org/works/10.1007%2FBF01933667"
      }
    ],
    "points": "110000",
    "published_grade": {
      "id": "pollard-rho-factorization-1975",
      "entry_id": "pollard-rho-factorization-1975",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:03af491b-5d83-43eb-af66-8f015323f4d5",
        "version": 1,
        "content_hash": "sha256:cfae20c7239c2dc9233aa7a2087495182f865b64f0669a48f138cec842fc080f"
      },
      "what_changed": "Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model.",
      "scope": "Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model. The method uses modular iteration and cycle/collision structure to seek a factor. Its expected behavior depends on heuristic randomness and the factor size; it is not a deterministic polynomial-time factorization guarantee. Failed runs may require changing parameters and do not prove primality. Later improvements and computational records retain separate credit.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:03af491b-5d83-43eb-af66-8f015323f4d5",
        "version": 1,
        "content_hash": "sha256:cfae20c7239c2dc9233aa7a2087495182f865b64f0669a48f138cec842fc080f"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "J. M. Pollard",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Pollard,AMonteCarloMethodforFactorization,BIT15(3),331-334(1975),original4pagejournal",
            "url": "https://pages.cs.wisc.edu/~cs812-1/pollardrho.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Pollard,AMonteCarloMethodforFactorization,BIT15(3),331-334(1975),original4pagejournal",
            "url": "https://pages.cs.wisc.edu/~cs812-1/pollardrho.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "PublisherCrossrefdepositfor10.1007/BF01933667",
            "url": "https://api.crossref.org/works/10.1007%2FBF01933667"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The method uses modular iteration and cycle/collision structure to seek a factor. Its expected behavior depends on heuristic randomness and the factor size; it is not a deterministic polynomial-time factorization guarantee. Failed runs may require changing parameters and do not prove primality. Later improvements and computational records retain separate credit.",
        "domain": "Computational number theory"
      },
      "sources": [
        {
          "citation": "Pollard,AMonteCarloMethodforFactorization,BIT15(3),331-334(1975),original4pagejournal",
          "url": "https://pages.cs.wisc.edu/~cs812-1/pollardrho.pdf"
        },
        {
          "citation": "PublisherCrossrefdepositfor10.1007/BF01933667",
          "url": "https://api.crossref.org/works/10.1007%2FBF01933667"
        }
      ],
      "statement": "# Pollard: finding integer factors with a short collision search\n\nPollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model.\n\nFactoring an integer by trying possible divisors can require many arithmetic operations. Pollard’s 1975 note proposed generating a sequence from a simple polynomial modulo the integer. When this sequence repeats modulo an unknown factor, a greatest-common-divisor calculation can reveal that factor without storing the whole sequence. The original method keeps only a few multi-length variables and combines several differences before computing a gcd. Its speed estimate relies explicitly on treating the induced mapping as random; this is not a worst-case guarantee for every polynomial or input. A gcd can also equal the whole integer, leaving no proper factor to extract, and a finite search can stop without finding anything. The note is therefore a practical search method rather than a universal fast, complete factorization theorem. Pollard’s earlier work and Knuth’s random-mapping ideas retain credit. The 1978 discrete-logarithm methods and Brent’s later improvements are separate contributions.\n\n## Scientific scope\n\nThe method uses modular iteration and cycle/collision structure to seek a factor. Its expected behavior depends on heuristic randomness and the factor size; it is not a deterministic polynomial-time factorization guarantee. Failed runs may require changing parameters and do not prove primality. Later improvements and computational records retain separate credit.\n\n## People and systems\n\nJ. M. Pollard\n\n\n\n## Original sources\n\n- [Pollard,AMonteCarloMethodforFactorization,BIT15(3),331-334(1975),original4pagejournal](https://pages.cs.wisc.edu/~cs812-1/pollardrho.pdf)\n- [PublisherCrossrefdepositfor10.1007/BF01933667](https://api.crossref.org/works/10.1007%2FBF01933667)\n",
      "summary": "Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model.\n\nFactoring an integer by trying possible divisors can require many arithmetic operations. Pollard’s 1975 note proposed generating a sequence from a simple polynomial modulo the integer. When this sequence repeats modulo an unknown factor, a greatest-common-divisor calculation can reveal that factor without storing the whole sequence. The original method keeps only a few multi-length variables and combines several differences before computing a gcd. Its speed estimate relies explicitly on treating the induced mapping as random; this is not a worst-case guarantee for every polynomial or input. A gcd can also equal the whole integer, leaving no proper factor to extract, and a finite search can stop without finding anything. The note is therefore a practical search method rather than a universal fast, complete factorization theorem. Pollard’s earlier work and Knuth’s random-mapping ideas retain credit. The 1978 discrete-logarithm methods and Brent’s later improvements are separate contributions.",
      "title": "Pollard: finding integer factors with a short collision search"
    },
    "record_id": "urn:uuid:03af491b-5d83-43eb-af66-8f015323f4d5",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:03af491b-5d83-43eb-af66-8f015323f4d5",
      "version": 1,
      "content_hash": "sha256:cfae20c7239c2dc9233aa7a2087495182f865b64f0669a48f138cec842fc080f"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:b5ae0ad9165da1a3554764d3afb8007c0946abf718d20e2a8612bfb0c722995e"
  },
  "target": {
    "record_id": "urn:uuid:03af491b-5d83-43eb-af66-8f015323f4d5",
    "version": 1,
    "content_hash": "sha256:cfae20c7239c2dc9233aa7a2087495182f865b64f0669a48f138cec842fc080f"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "pollard-rho-factorization-1975",
    "entry_id": "pollard-rho-factorization-1975",
    "revision": 1,
    "title": "Pollard: finding integer factors with a short collision search",
    "context": "Computational number theory",
    "track": "Computational number theory",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model.",
    "scope": "Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model. The method uses modular iteration and cycle/collision structure to seek a factor. Its expected behavior depends on heuristic randomness and the factor size; it is not a deterministic polynomial-time factorization guarantee. Failed runs may require changing parameters and do not prove primality. Later improvements and computational records retain separate credit.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Pollard, AMonte Carlo Methodfor Factorization, BIT 15(3),331-334(1975), original 4 pagejournal",
        "url": "https://pages.cs.wisc.edu/~cs812-1/pollardrho.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Publisher Crossrefdepositfor 10.1007/BF 01933667",
        "url": "https://api.crossref.org/works/10.1007%2FBF01933667",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "J. M. Pollard",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:03af491b-5d83-43eb-af66-8f015323f4d5",
      "version": 1,
      "content_hash": "sha256:cfae20c7239c2dc9233aa7a2087495182f865b64f0669a48f138cec842fc080f"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "110000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}