n=8 R=80.0: 3395 reachable points (51472 nodes), types: A0:1644, A1:481, A2:277, A3:235, A4:277, A5:481
Conj 2.6: 2449 (point, l, eps) instances tested, 0 failures, 0 parallel points not found (must be 0)
Conj 2.7: 2449 pairs of parallel short trajectories tested, 0 failures
pairs (u,v) of reachable points with det(u,v) = sin(2 pi/n): 2867
  their (type u, type v) distribution: {(0, 0): 953, (0, 5): 957, (1, 0): 957}
Conj 2.3: 41 reachable n-gons inside radius R examined, 0 with wrong vertex types (2742 pairs undecided because a vertex leaves the disc)
  unitary pairs (types A0,A0): 41 span a reachable n-gon, 0 do not (must be 0); non-unitary pairs spanning a reachable n-gon: 0 (must be 0)
Conj 2.5 (corrected form: steps lambda^2, offsets 0 and lambda^2-1): 953 unitary pairs, 6860 predicted points inside the disc, 0 missing, 0 reachable points on the lines not of the predicted form/type
Conj 2.5 literal (a): n even, lambda=2cos(pi/n) is not in Q(zeta_n), so u+m(lambda+1)v is never a vertex of the development for m != 0
Conj 2.4: examined all reachable points with |w| <= R0 = 10.0: 55 points; a-priori bound for the vertices of an n-gon through w: |v_i| <= 12.6173 |w|; search exhaustive for types != A0: False
  points by type: {0: 28, 1: 9, 2: 3, 3: 3, 4: 3, 5: 9}
  points lying on NO reachable n-gon, by type: {0: 8, 1: 5, 2: 2, 3: 2, 4: 2, 5: 5}
  maximal number of reachable n-gons through a point of type != A0: {1: 1, 2: 1, 3: 1, 4: 1, 5: 1}
  shortest points on no reachable n-gon (ring coordinates in Z[zeta_8], type, radius):
     (2, 3, 1, 0) type A5 |w| = 5.169905 (x,y) = (4.121320, 3.121320)
     (0, 1, 3, 2) type A1 |w| = 5.169905 (x,y) = (-0.707107, 5.121320)
     (2, 3, 3, 1) type A4 |w| = 6.754807 (x,y) = (3.414214, 5.828427)
     (-1, 2, 3, 3) type A2 |w| = 6.754807 (x,y) = (-1.707107, 6.535534)
     (3, 3, 2, -1) type A4 |w| = 6.754807 (x,y) = (5.828427, 3.414214)
     (1, 3, 3, 2) type A2 |w| = 6.754807 (x,y) = (1.707107, 6.535534)
total time 12.0s
