integer-mult-bounds/CITATION.cff at main · DLamdata/integer-mult-bounds · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
cff-version: 1.2.0
message: >-
  Please cite the selected composition and its constituent contributions,
  this project and the upstream manuscript. The selected checkpoint is PR4470 on the cumulative productive-helper framework; consult certificates/selected-result.json for publication status.
  Project-level authorship identifies the maintainer, not sole authorship of
  the community result. See CONTRIBUTORS.md and the frozen source notices.
title: "A sharper exponent for integer multiplication"
authors:
  - family-names: Colkitt
    given-names: Douglas
license: Apache-2.0
type: software
version: "community-joint4470-2026-10-22"
date-released: 2026-10-22
repository-code: "https://github.com/CrocSwap/integer-mult-bounds"
url: "https://github.com/CrocSwap/integer-mult-bounds"
abstract: >-
  Community research on integer multiplication. The selected maintainer-reviewed
  conditional construction has kappa = 60403/20000000 = 0.00302015.
  Cinna Davis's PR4470 joint helper frames and query-thinned controller build on
  her preceding constructions, zxv's native/productive-helper and compiler work,
  Jacob Alan Sussman's mixed-target recursion, and the cumulative community
  framework. Exact finite replays and independent audits retain explicit
  all-column/native, owned-erasure, compiler, precision/tape, analytic, prime
  and recovery assumptions. This is not a complete formal multiplication proof.
preferred-citation:
  type: software
  title: "A sharper exponent for integer multiplication: community research repository"
  authors:
    - family-names: Colkitt
      given-names: Douglas
  year: 2026
  url: "https://github.com/CrocSwap/integer-mult-bounds"
  notes: >-
    Maintainer citation only, not sole authorship of the mathematical result.
    Credit Cinna Davis (PR4470/4447/4441/4440/4416), zxv (PR4359/4433),
    Jacob Alan Sussman (PR4268), independent auditors Mihir Srivastava and
    Ryanson Jonathan, Mark/Matarener for the commutation question, and the full
    geometry, binary, native, precision and outer lineage, including Rohan Arun,
    Jeremy Kothe, Chafik Boukhalfa and the contributors listed in CONTRIBUTORS.md
    and docs/research/community-joint4470-contributors.md. Cite constituent PRs
    where their results are used; preserve their licenses and assistance disclosures.
keywords:
  - integer multiplication
  - computational complexity
  - exact arithmetic
  - parameter optimization
  - reproducible research
references:
  - type: unpublished
    title: "Integer multiplication below n log n"
    authors:
      - name: OpenAI
    year: 2026
    url: "https://github.com/openai/math/tree/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Integer-multiplication-below-n-log-n-September-23-2026"