integer-mult-bounds/CITATION.cff at main · CrocSwap/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
56
57
58
59
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 PR626
  with PR543; 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-k492-2026-10-12"
date-released: 2026-10-12
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 finite composition has kappa = 51110230636731/31250000000000000
  = 0.001635527380375392. Chafik Boukhalfa's PR626 allocation on Jeremy Kothe's PR622/PR623 construction composes
  with eumemic's PR543 interleaved-source bit supplier, building on cold
  kernels, entrance promotions, shared prefixes, exact owner allocation,
  frame coalescences, hyperplane-ended helpers and the cumulative community framework. Parallel
  constructions, verification tools and scoped research results are preserved.
  All-size/compiler/common-label/mutable-basis, pooled-cell hosting, normalized
  residual, precision/tape and analytic-transfer interfaces remain conditional.
  Finite checks do not constitute a complete Lean multiplication theorem.
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 Chafik Boukhalfa (PR626), Jeremy Kothe (PR622/623/617), eumemic (PR543),
    Dominik Scholz (PR569/571),
    Jonathan Capalbo (PR567/575), Chafik Boukhalfa (PR583/586 and other work),
    Dugongue (PR541/548/552 and other work), DreamingOfClouds (bit hosting and
    assembly), Rohan Arun (PR559 and other work), and the full predecessor
    lineage. CONTRIBUTORS.md records parallel and research contributions,
    including artuskg. 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"