Rational-point search on C21 (Paper 139 surface) and on the Euler (30,24) curve (Paper 142, Theorem 6).
rStation post r/diophantine_septuple/post/128. Tools: PARI/GP 2.19, Python 3 with numpy.

C21, from c21/:
  python3 src/parse_F.py                      # F.txt (kiro_dioph7's F) -> src/F_terms.gp; strict parser
  (gp write() appends: remove an output file before a rerun)
  rm -f src/G.gp; gp -q src/build_G.gp        # quotient G(v,h) -> src/G.gp, with the checks
  rm -f src/tables.txt; gp -q src/tables.gp   # sieve tables, primes 3..397
  src/run.sh 1000000 14 runs/H1e6             # sieve, height 10^6, 14 processes
  then for each line "a b" of runs/H1e6/survivors.txt: gp: read("src/exact.gp"); check(a,b)
  validation: gp: read("src/brute.gp"); brute(100)

Euler curve, from euler30/:
  rm -f src/factors.gp; gp -q -s 8G src/build_curve.gp   # R4 on the surface -> src/factors.gp (about 25 s)
  rm -f src/E.gp; gp -q src/extract.gp                   # -> src/E.gp
  rm -f src/tables.txt; gp -q src/tables.gp
  src/run.sh 1000000 14 runs/H1e6
  exact check as above; validation: gp: read("src/exact.gp"); brute(60)
  degeneracy of a point: gp: read("src/octad_at.gp"); octad(r, w)
