{"name":"integer-mult-bounds","repo":"CrocSwap/integer-mult-bounds","url":"https://midorreal.com/project/crocswap-integer-mult-bounds","repository":"https://github.com/CrocSwap/integer-mult-bounds","description":"Conditional integer multiplication: kappa > 2^-15. Community proofs, exact certificates and reproducible audits; assumes the OpenAI #109 framework.","facts":{"license":{"value":"Apache-2.0","source":"https://github.com/CrocSwap/integer-mult-bounds","checked":"22 Nov 2026"},"language":{"value":"Python","source":"https://github.com/CrocSwap/integer-mult-bounds","checked":"22 Nov 2026"},"last_release":{"value":"community-kappa-15-2026-10-08, 8 Oct 2026","source":"https://github.com/CrocSwap/integer-mult-bounds/releases","checked":"22 Nov 2026"},"releases":{"value":"1","source":"https://github.com/CrocSwap/integer-mult-bounds/releases","checked":"21 Nov 2026"},"contributors":{"value":"263","source":"https://github.com/CrocSwap/integer-mult-bounds/graphs/contributors","checked":"21 Nov 2026"},"archived":{"value":"no","source":"https://github.com/CrocSwap/integer-mult-bounds","checked":"22 Nov 2026"}},"stars":323.0,"writeup":{"what_it_is":"A community research repository on integer multiplication complexity, maintained by Douglas Colkitt. It records a conditional exponent saving kappa (about 0.00363) for a bound of the form O(n(log n)^(1-kappa)), with certificates, reviews and audit scripts. The results are conditional on the OpenAI #109 framework.","audience":"Researchers and contributors studying integer multiplication bounds and verifying proofs.","claims":[{"kind":"specific","claim":"Gives a conditional bound with exponent saving kappa = 0.00363005817.","excerpt":"\\kappa=\\frac{363005817}{100000000000}=0.00363005817.","status":"not_checked"},{"kind":"specific","claim":"Includes a complete caller with 23,392 productive fields and 117,612 paid calls.","excerpt":"The complete complex caller has **23,392 productive fields and 117,612 paid","status":"not_checked"},{"kind":"specific","claim":"Provides a fast source and metadata check that does not replay operators.","excerpt":"Fast source/metadata check; no operator replay.","status":"not_checked"},{"kind":"specific","claim":"Offers a complete serial finite replay in a fresh isolated export.","excerpt":"Complete serial finite replay in a fresh isolated export.","status":"not_checked"}],"alternatives":[],"written_by":"AI, from the project's README","date":"2026-11-17"},"why_now":null,"owner_supplied":null,"score":{"verdict":"sleeper","hype":13,"reality":79,"gap":-66,"momentum":0.3,"confidence":60,"version":"score-2.0","rule":"verdict-2.0","calculated_at":"2026-11-22T07:00:00+00:00","verdict_source":"rule"},"early_read":null,"changes":[{"date":"2026-10-08T15:18:46+00:00","text":"Latest release community-kappa-15-2026-10-08","source":"https://github.com/CrocSwap/integer-mult-bounds/releases"},{"date":"2026-10-07T02:21:37+00:00","text":"Repository created","source":"https://github.com/CrocSwap/integer-mult-bounds"}],"cite":"integer-mult-bounds is a GitHub project at https://github.com/CrocSwap/integer-mult-bounds written mainly in Python, described there as \"Conditional integer multiplication: kappa > 2^-15. Community proofs, exact certificates and reproducible audits; assumes the OpenAI #109 framework\".","attribution":"Data from Mid or Real, https://midorreal.com/project/crocswap-integer-mult-bounds, checked 22 November 2026. Attribution with a link is required.","still_real":null}