SIGNIFICANCE

Clear records for AI-assisted mathematics

Take this check

Check the n = 8 geometric deduction only; report the exact passages followed and any first unresolved step.

2026-evanbeller-erdos-132 · task erdos-132-n8-geometry

Task type
read check
Entry points
Multiplicity profile, deletion argument, and overlap-rigidity lemma
Source PDF
Download the exact manuscript
Erdős Problem #132, n = 8 proof writeup · version 5d3faea03531…
Effort
about 90 minutes (estimated by significance-editor)
Prerequisites
Planar distance geometry and the cited seven-point classification

Status

Open.

How to do this

  1. Download the exact manuscript above and start with the stated entry points. The version hash identifies the file for the eventual record; you do not need to calculate it before reading.
  2. Read or reproduce only the stated scope and note the method you actually used.
  3. Submit what you found through the linked attestation form below, using the record, task, scope, and manuscript hash shown here. No Significance account is required; GitHub may ask you to sign in.

Open attestation form

Attestation template

Fill only what you did. State what you checked and found—not whether the whole proof is correct.

id: att-erdos-132-n8-geometry
task_id: erdos-132-n8-geometry
reviewer: '[your name or handle]'
scope: Check the n = 8 geometric deduction only; report the exact passages 
  followed and any first unresolved step.
manuscript_sha256: 
  5d3faea03531035426c9f5ca8ece9c8db90ff2cdaff4238f3eb1090747c5b209
asserted_at: '[YYYY-MM-DDTHH:MM:SSZ]'
method: '[what you actually did: read / rederived / rebuilt / compared]'
finding: '[what you checked and found about exactly this scope]'
limits: '[what you did not check — optional but encouraged]'