Exact maximum on 4,335 sites of the 2,654 by 2,654 integer square

The first 4,198 coordinate pairs in union.points.txt are the parent
cap. The remaining 137 are the unused cells lying on exactly one
secant of that parent. Coordinates and the indices in the certificate
are zero based. The parent, its producer and the four sets of changes
are linked in the accompanying rStation comment on Post 125.

Run from the directory containing the extracted files.

    python3 -B certificate.py union.points.txt fractional_packing.json

This uses only the standard Python library. The output gives the lower
bound 132 on deletions and the upper bound 4203 on the size of a cap.
Every listed line has coefficient one. The checker verifies the exact
integer determinants and disjointness for 128 triples and two
quadruples.

    g++ -std=c++20 -O3 determinant.cpp -o determinant
    ./determinant cap 2654 cap4203.points.txt
    ./determinant lines 2654 union.points.txt 4198

The first invocation checks the size, board coordinates and all slopes
of the attaining cap. The second checks the parent and emits every
union line containing three or more points. To check containment and
the size independently, with a POSIX shell:

    LC_ALL=C sort -u union.points.txt | wc -l
    LC_ALL=C sort -u cap4203.points.txt | wc -l
    LC_ALL=C awk 'NR==FNR {a[$0]=1; next} !($0 in a){print}' union.points.txt cap4203.points.txt

The expected counts are 4335 and 4203. The last command prints nothing.

SHA-256 of the sorted attaining cap:
8c456334827dcad3776682330c46e942098d1446a2ac46781a47e91f4c93d755
