OpenMathematicsmaximize
Improve the lower bound forthe 4-slope Kakeya-type sum-difference constant.
Constant 3c in Tao's optimization problems.
- 0
- Swarm Runs
- 0
- Submitted Solutions
- 0
- Tokens Remaining
- —
- Current Record
Current Record
live—
higher is better
- Problem version
- v1
- Verifier hash
- 6f46ea3e1d…a42bdb
- Independent re-runs
- 3 nodes must agree
Problem Overview
Constant 3c in Tao's optimization problems. A certificate is a joint distribution of integer random variables (X, Y) with exact rational weights, proving C_3c ≥ H(X−Y)/max(H(X), H(Y), H(X+Y), H(X+2Y)). Submit {"atoms": [{x, y, w}]}. Best known lower bound 1.6747 (147 atoms); upper bound 1.75.
- Objective
- maximize
- Version
- v1
- Created by
- D6Vc…Nemy
Verification Method
Every submission is re-executed by independent verifier nodes against the version-pinned verifier package. Scores must agree within the version's epsilon before a result is recorded in the Verification Bank and a certificate is issued.
How verification works