Vela

frontiers / frontier

Additive combinatorics: Sidon sets and N(h,k) bounds

constellation seal · derived from vfr_496956067dc5ad79
id
vfr_496956067dc5ad79
license
CC-BY-4.0
findings
22
accepted core
1
contested
1
links
0
sources
22
evidence
22
avg conf
0.83

used by 1 · replayed by 1 producer · second seat open

e33/33 · finding.asserted · reviewer:will · 2026-06-03 · null→e123

Reviewable change

back to review

finding.span_repair

verified — A frozen deterministic verifier re-checked the claim and passed.accepted

Ellenberg-Gijswijt extend Croot-Lev-Pach to prove a 3-AP-free subset of F_3^n has size at most 2.756^n, settling the cap-set problem up to a constant in the exponent.

id
vpr_11afa6e155380c7f
frontier
Additive combinatorics: Sidon sets and N(h,k) bounds
kind
finding.span_repair
created
2026-05-21
state
bad92b10 → 4021aa2d

accept gate

1 of 4 on record
signature
reviewer:solo-maintainer · no key registered on this bundle
chain
bad92b10 → 4021aa2d
witness
no verifier attachment on record for this target
grade
in state · unreviewed

timeline

  1. 2026-05-21proposeproposed · finding.span_repairreviewer:solo-maintainerreviewer:solo-maintainervpr_11afa6e155380c7fAttach source-backed abstract span for the Ellenberg-Gijswijt cap-set result; leaves the numeric constant as methodology context rather than new accepted evidence.
  2. 2026-05-21acceptfinding.span_repairedreviewer:solo-maintainerreviewer:solo-maintainerbad92b104021aa2dvev_3b8bca3bf09d4358Attach source-backed abstract span for the Ellenberg-Gijswijt cap-set result; leaves the numeric constant as methodology context rather than new accepted evidence.

proposed

reason

Attach source-backed abstract span for the Ellenberg-Gijswijt cap-set result; leaves the numeric constant as methodology context rather than new accepted evidence.

provenance

proposed by

reviewer:solo-maintainerreviewer:solo-maintainer

actor type

human

created at

2026-05-21

target type

finding

Ellenberg-Gijswijt extend Croot-Lev-Pach to prove a 3-AP-free subset of F_3^n has size at most 2.756^n, settling the cap-set problem up to a constant in the exponent.

vf_eee5b19763f3c625

Diff

Read-only frontier; diff not recomputed.

Review chain

  1. 01request

    Change request

    Additive combinatorics: Sidon sets and N(h,k) bounds receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.

    open review
  2. 02packet

    Diff packet

    The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.

    open the campaign
  3. 03checks

    Check output

    Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.

    inspect checks
  4. 04review

    Reviewer decision

    A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.

    read queue
  5. 05accepted

    Accepted event

    Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.

    inspect events

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.