For every dimension n>=8 there is a degree bound uniform over all scalar real polynomial minimal graphs

Submission policy respected - Passed

The submitted source passed the static scan: no imports, no axiom declarations, no sorry, no native_decide, no unsafe options.

Production sandbox - Passed

The run happened under real isolation, Landrun with seccomp, and the sandbox passed its own live self-test before the proof was touched.

Challenge built - Passed

The trusted Challenge.lean, which contains no miner code, compiled on its own.

Source type hash matches - Passed

The source theorem in the compiled environment still hashes to the type recorded in the task, so the statement has not drifted upstream.

Solution built - Passed

The submitted Solution.lean compiled.

Statement unchanged - Passed

The theorem the proof establishes has exactly the same canonical type as the task's target - it was not weakened or restated.

Only permitted axioms - Passed

The transitive axiom closure of the proof stays inside the axioms this task permits.

Lean kernel accepted - Passed

The Lean kernel replayed the proof and accepted it.

Nanoda accepted - Not run

A second kernel, written independently of Lean's, also accepted the proof.