2688 3 12
2688047043
1681 1345 1 1 1345 1
759 1050 2268 2541 2625 336
1793 1 1793 1921 1 1
1944 2040 2408 610 2640 2456
# solutions_found 1
# distance_bound_overall 128
# 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 336
# latent_z_upper 336
# latent_min_upper 336
# latent_x_support [(0,45) (0,141) (0,237) (0,333) (0,429) (0,525) (0,621) (0,717) (0,813) (0,909) (0,1005) (0,1101) (0,1197) (0,1293) (0,1389) (0,1485) (0,1581) (0,1677) (0,1773) (0,1869) (0,1965) (0,2061) (0,2157) (0,2253) ...]
# latent_z_support [(0,62) (0,158) (0,254) (0,350) (0,446) (0,542) (0,638) (0,734) (0,830) (0,926) (0,1022) (0,1118) (0,1214) (0,1310) (0,1406) (0,1502) (0,1598) (0,1694) (0,1790) (0,1886) (0,1982) (0,2078) (0,2174) (0,2270) ...]
# nonlatent_method m-block-constant compression kernel -> lift
# nonlatent_note probabilistic search over all divisors m>=2 of P (best m_X=64, m_Z=64)
# nonlatent_x_upper 128
# nonlatent_z_upper 128
# nonlatent_min_upper 128
# nonlatent_x_m 64
# nonlatent_z_m 64
# nonlatent_x_support [(1,7) (1,49) (1,91) (1,133) (1,175) (1,217) (1,259) (1,301) (1,343) (1,385) (1,427) (1,469) (1,511) (1,553) (1,595) (1,637) (1,679) (1,721) (1,763) (1,805) (1,847) (1,889) (1,931) (1,973) ...]
# nonlatent_z_support [(3,0) (3,42) (3,84) (3,126) (3,168) (3,210) (3,252) (3,294) (3,336) (3,378) (3,420) (3,462) (3,504) (3,546) (3,588) (3,630) (3,672) (3,714) (3,756) (3,798) (3,840) (3,882) (3,924) (3,966) ...]
# 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