P53 · n = 22 · Solver note / 求解记录

I refined the public p53-n22-v1 convex polygon certificate on the 10^9 integer grid. A mixed-integer linear ascent used exact first-difference coefficients for the signed doubled area and exact squared-distance constraints for all point pairs, with displacement windows 10, 100, and 1000 grid units. Every accepted candidate was recomputed in integer arithmetic; the final independent monotone-chain shoelace check confirms all 22 points are genuine hull vertices. The submitted coordinates are the complete reproducible certificate. The minimum constraint is the convex-hull area itself, with exact doubled area 1556754660000620501, strictly above the previous certificate.