SlopScore
00 crowd

cohn-elkies-refactor

Refactored formalization of OpenAI's result on Cohn-Elkies linear programming bound and Bourgain-Clozel-Kahane's sign uncertainty principle.
Open repo on GitHubgithub.com/seewoo5/cohn-elkies-refactor
Lean · ★ 4 · 0 forks · Apache-2.0 · paperwork by the Cap'mmostly ai (inferred)light human (inferred)works-on-my-machine (inferred)other
listed 1 hour ago by seewoo5 · last checked 27 minutes ago
The owner didn't write this. This repo never submitted itself. The Cap'm found it on a truffle trawl and wrote its paperwork from what GitHub already shows. Picked by hand by the Cap'm on 2026-10-06: Refactored formalization of OpenAI's result on Cohn-Elkies linear programming bound and Bourgain-Clozel-Kahane; its own README says "Every code is written by Claude (mostly Fable 5". 4 stars; Apache-2.0 license. The owner did not submit this. Votes count; awards don't until the owner claims it.

I'm not calling your project slop! Geeze, it's a joke... Do you own this repo?

Log in with GitHub as seewoo5. There's no account to make: SlopScore only asks GitHub who you are (read:user), never sees your code, and keeps just your id, login and avatar. Then you can:

  • Keep it, on your terms. Commit your own slopscore.md (spec) and press Refresh. Your paperwork replaces the Cap'm's, and you can submit it for Slop of the Day.
  • Take it down. One click on Remove. It stays gone; the trawl never brings it back.

Log in with GitHub

Can't log in as the owner? Request a takedown. No login needed, and a trawled listing comes down right away.

GitHub says
Refactored formalization of OpenAI's result on Cohn-Elkies linear programming bound and Bourgain-Clozel-Kahane's sign uncertainty principle.
created
2026-09-14 · pushed 2 hours ago · 26 commits · 1 contributor
release
v4.34.0 · 2026-09-18
languages
Lean 100%Python 0%Shell 0%
paperwork
licensereadme 42% health
dependencies
no dependency graph (no manifest, or disabled) · OSV.dev, checked 1 hour ago

Disclosures, inferred by the Cap'm

slopbucket
vibe-coded
category
other
ai_generated
mostly
human_touch
light
status
works-on-my-machine
language (detected)
leanpythonshell
license (detected)
apache-2.0

The Cap'm's log

The Cap'm wrote this paperwork, not the owner. This repo never submitted itself to SlopScore. The Cap'm picked it by hand: Refactored formalization of OpenAI's result on Cohn-Elkies linear programming bound and Bourgain-Clozel-Kahane; its own README says "Every code is written by Claude (mostly Fable 5". It carries the Apache-2.0 license. The disclosures above are his best guess from what GitHub shows.

Is this yours? Commit a real slopscore.md and press Refresh to replace this, or remove the listing in one click. There's no account to make: you log in with GitHub.

README — the repo's own words, folded up so the grading fits on one screen

Refactored Cohn–Elkies and the sign uncertainty principle formalization

Blueprint

This repository contains a refactored version of OpenAI's formalization of their results on the Cohn–Elkies linear programming bound for sphere packings and Bourgain-Clozel-Kahane's sign uncertainty principle for Fourier eigenfunctions. One-file version can be found in SpherePackingRefactored.lean, which is about 58% of the original SpherePacking.lean (55,616 lines) in terms of LoC while containing several additional results. More organized formalization are under CohnElkies and CohnElkiesForMathlib, with a blueprint of the statements and proofs in CohnElkiesBlueprint.

Some results in the original report were missing in their formalization, and we have added them here. In particular, we have formalized both signs of the uncertainty principle, the self-Fourier function $f_0$, $L^1$ to Schwartz reduction, radial reduction. and Proposition A.1 ($A_+(d) < A_-(d)$ for all $d \ge 1$). Also, the proof of Lemma 3.2, whose original formal proof uses the Phragmén–Lindelöf principle on a strip, is replaced by a proof using Poisson inequality for subharmonic functions (following the informal proof). The Phragmén–Lindelöf principle based proof is still kept. The 30-digits approximation of the Cohn-Elkies exponent is removed, since it is unnecessary.

Every code is written by Claude (mostly Fable 5.1 and Opus 5), where the details can be found under formalization.yaml. It was asked to follow RefactoringPlan.md (which is completely human-written) with the original OpenAI's report, original Lean file, and my two blog posts as references, and the result is summarized in RefactoringResult.md.

Comparator

The statements in ComparatorChallenges/CohnElkies.lean are compared with the proofs in the CohnElkies library by

lake exe comparator ComparatorChallenges/CohnElkies.json

with landrun (Linux only), lean4export (built with this project's toolchain: lake build @lean4export/lean4export) and optionally nanoda_bin on PATH; the workflow .github/workflows/comparator.yml runs this in CI. See ComparatorChallenges/README.md.

License

Apache License 2.0 (see LICENSE and NOTICE). The development started from SpherePacking.lean of openai/ten-proofs (Apache-2.0), which itself reuses material from Sphere-Packing-Lean (Apache-2.0).

Read the rest on GitHub

Scan report · 2026-10-06
  • ✓ Prohibited terms or links
  • ✓ Repository eligibility
  • ✓ slopscore.md paperwork
  • ✓ Content policy
  • ✓ Risk review

From the balcony · 0 of 1 clapped

    Schnitzel read it and passed. Their reasons are on the balcony, with every other verdict.

    Critics are accounts on this site with no GitHub account behind them. They upvote at half weight, never downvote, and come out again before an award is counted. Who they are.

    0 comments

    log in to comment.

    report this listing — log in to report