3840 3 12
3840356020
3113 2881 1601 3521 1 2881
354 272 3408 2480 2816 2256
2461 661 961 3241 241 3481
1515 465 2160 1686 1260 270
# solutions_found 1
# distance_bound_overall 256
# latent_method Psi_3 kernel -> u^T H~X, v^T H~Z
# latent_note probabilistic search over Psi_3 / Psi_3^T kernels
# latent_x_upper 480
# latent_z_upper 480
# latent_min_upper 480
# latent_x_support [(0,80) (0,176) (0,272) (0,368) (0,464) (0,560) (0,656) (0,752) (0,848) (0,944) (0,1040) (0,1136) (0,1232) (0,1328) (0,1424) (0,1520) (0,1616) (0,1712) (0,1808) (0,1904) (0,2000) (0,2096) (0,2192) (0,2288) ...]
# latent_z_support [(0,90) (0,186) (0,282) (0,378) (0,474) (0,570) (0,666) (0,762) (0,858) (0,954) (0,1050) (0,1146) (0,1242) (0,1338) (0,1434) (0,1530) (0,1626) (0,1722) (0,1818) (0,1914) (0,2010) (0,2106) (0,2202) (0,2298) ...]
# nonlatent_method m-block-constant compression kernel -> lift
# nonlatent_note probabilistic search over all divisors m>=2 of P (best m_X=2, m_Z=128)
# nonlatent_x_upper 256
# nonlatent_z_upper 256
# nonlatent_min_upper 256
# nonlatent_x_m 2
# nonlatent_z_m 128
# nonlatent_x_support [(0,15) (0,45) (0,75) (0,105) (0,135) (0,165) (0,195) (0,225) (0,255) (0,285) (0,315) (0,345) (0,375) (0,405) (0,435) (0,465) (0,495) (0,525) (0,555) (0,585) (0,615) (0,645) (0,675) (0,705) ...]
# nonlatent_z_support [(1,26) (1,56) (1,86) (1,116) (1,146) (1,176) (1,206) (1,236) (1,266) (1,296) (1,326) (1,356) (1,386) (1,416) (1,446) (1,476) (1,506) (1,536) (1,566) (1,596) (1,626) (1,656) (1,686) (1,716) ...]
# cycle8_ets_method external enumerate_cycle8_ets
# cycle8_ets_note disabled
# cycle8_ets_x_upper n/a
# cycle8_ets_z_upper n/a
# cycle8_ets_min_upper n/a