import multiprocessing as mp import numpy as np import time ...
Prompt
import multiprocessing as mp import numpy as np import time import os P_MOD = 1009 # p > 108 + 144 - 2 = 250 -> nincs Frobenius-csalás! def gf_rref_solve(A, b, p=P_MOD): A = A.copy() % p b = b.copy() % p m, n = A.shape Aug = np.hstack([A, b.reshape(-1, 1)]) % p pivots = [] row = 0 for col in range(n): if row >= m: break nz = np.where(Aug[row:, col] != 0)[0] if len(nz) == 0: continue piv_r = row + nz[0] if piv_r != row: Aug[[row, piv_r]] = Aug[[piv_r, row]] inv = pow(int(Aug[row, col]), -1, p) Aug[row] = (Aug[row] * inv) % p mask = np.arange(m) != row factors = Aug[mask, col:col+1] nz_r = np.where(factors[:, 0] != 0)[0] if len(nz_r) > 0: t_idx = np.where(mask)[0][nz_r] Aug[t_idx] = (Aug[t_idx] - factors[nz_r] * Aug[row:row+1]) % p pivots.append((row, col)) row += 1 rank = len(pivots) for r in range(rank, m): if Aug[r, n] != 0: return False, None x_part = np.zeros(n, dtype=np.int64) for r, c in pivots: x_part[c] = Aug[r, n] return True, x_part def eval_108_144(params_p, AX, AY, p=P_MOD): ones = np.ones_like(AX) zeros = np.zeros_like(AX) Xj = (AX, ones, zeros) Yj = (AY, zeros, ones) def p_add(a, b): return ((a[0]+b[0])%p, (a[1]+b[1])%p, (a[2]+b[2])%p) def p_mul(a, b): return ((a[0]*b[0])%p, (a[1]*b[0]+a[0]*b[1])%p, (a[2]*b[0]+a[0]*b[2])%p) def p_pow(a, exp): res = (ones.copy(), zeros.copy(), zeros.copy()) base, e = a, exp while e > 0: if e & 1: res = p_mul(res, base) base = p_mul(base, base) e >>= 1 return res def p_scale(c, a): return ((c*a[0])%p, (c*a[1])%p, (c*a[2])%p) X2 = p_pow(Xj, 2); Y2 = p_pow(Yj, 2); XY = p_mul(Xj, Yj) h1_c, h2_c, h3_c, h4_c, cp = params_p[:6], params_p[6:12], params_p[12:17], params_p[17:22], params_p[22:] lin = p_add(Yj, p_scale(h1_c[0], Xj)) H1 = p_pow(lin, 3) for cv, tm in zip(h1_c[1:], [X2, XY, Xj, Yj, (ones, zeros, zeros)]): if cv != 0: H1 = p_add(H1, p_scale(cv, tm)) H2 = p_pow(H1, 2) for cv, tm in zip(h2_c, [p_mul(H1, Xj), p_mul(H1, Yj), p_mul(X2, Yj), p_mul(Xj, Y2), Xj, Yj]): if cv != 0: H2 = p_add(H2, p_scale(cv, tm)) H3 = p_pow(H2, 3) H1_2 = p_pow(H1, 2) for cv, tm in zip(h3_c, [p_mul(H2, H1), p_mul(H2, Xj), H1_2, Xj, Yj]): if cv != 0: H3 = p_add(H3, p_scale(cv, tm)) H4 = p_pow(H3, 2) H2_2 = p_pow(H2, 2) for cv, tm in zip(h4_c, [p_mul(H3, H1), p_mul(H3, Xj), H2_2, Xj, Yj]): if cv != 0: H4 = p_add(H4, p_scale(cv, tm)) H4_2 = p_pow(H4, 2); H4_3 = p_mul(H4_2, H4); H4_4 = p_pow(H4_2, 2) P_terms = [ p_mul(H4_2, H3), p_mul(H4_2, H2), p_mul(H4_2, H1), p_mul(H4_2, Xj), p_mul(H4_2, Yj), p_mul(H4, H3), p_mul(H4, H2), p_mul(H4, H1), p_mul(H4, Xj), p_mul(H4, Yj), H3, H2, H1, X2, XY, Y2, Xj, Yj ] P_j = H4_3 for cv, tm in zip(cp, P_terms): if cv != 0: P_j = p_add(P_j, p_scale(cv, tm)) Q_terms = [H4_4] + [ p_mul(H4_3, H3), p_mul(H4_3, H2), p_mul(H4_3, H1), p_mul(H4_3, Xj), p_mul(H4_3, Yj), H4_3, p_mul(H4_2, H3), p_mul(H4_2, H2), p_mul(H4_2, H1), p_mul(H4_2, Xj), p_mul(H4_2, Yj), H4_2, p_mul(H4, H3), p_mul(H4, H2), p_mul(H4, H1), p_mul(H4, Xj), p_mul(H4, Yj), H4, p_mul(H3, H2), p_mul(H3, H1), H3, p_mul(H2, H1), H2, H1_2, H1, X2, XY, Y2, Xj, Yj ] return P_j, Q_terms def worker(wid, stop_event, total_counter): p = P_MOD rng = np.random.default_rng(int(time.time() * 1e6) + wid * 9973) n_grid = 100 gx = rng.integers(0, p, size=n_grid, dtype=np.int64) gy = rng.integers(0, p, size=n_grid, dtype=np.int64) AX = np.concatenate([gx, np.array([0, 1], dtype=np.int64)]) AY = np.concatenate([gy, np.array([0, 0], dtype=np.int64)]) b = np.ones(n_grid + 2, dtype=np.int64) b[n_grid] = 0 b[n_grid + 1] = 1 local_cnt = 0 while not stop_event.is_set(): params_p = rng.integers(0, p, size=40, dtype=np.int64) P_j, Q_terms = eval_108_144(params_p, AX, AY, p) diff_P = (P_j[0][-1] - P_j[0][-2]) % p P_j = ((P_j[0] - diff_P * AX) % p, (P_j[1] - diff_P) % p, P_j[2]) n_q = len(Q_terms) A = np.zeros((n_grid + 2, n_q), dtype=np.int64) Px_g, Py_g = P_j[1][:n_grid], P_j[2][:n_grid] for k, (qv, qx, qy) in enumerate(Q_terms): A[:n_grid, k] = (Px_g * qy[:n_grid] - Py_g * qx[:n_grid]) % p A[n_grid, k] = (qv[-1] - qv[-2]) % p A[n_grid + 1, 0] = 1 ok, q_sol = gf_rref_solve(A, b, p) local_cnt += 1 if local_cnt % 50 == 0: with total_counter.get_lock(): total_counter.value += 50 if ok: # Független 200 pontos verifikáció vx = rng.integers(0, p, size=200, dtype=np.int64) vy = rng.integers(0, p, size=200, dtype=np.int64) Pv, Qv = eval_108_144(params_p, vx, vy, p) Pv_x = (Pv[1] - diff_P) % p Pv_y = Pv[2] J_val = np.zeros(200, dtype=np.int64) for k, (_, qx, qy) in enumerate(Q_terms): if q_sol[k] != 0: J_val = (J_val + q_sol[k] * (Pv_x * qy - Pv_y * qx)) % p if np.all(J_val == 1): stop_event.set() with open("COUNTEREXAMPLE_108_144.txt", "w") as f: f.write(f"p={p}\ndiff_P={diff_P}\nparams_p={params_p.tolist()}\nq_sol={q_sol.tolist()}\n") print(f"\n[!!!] ELLENPÉLDA MENTVE: COUNTEREXAMPLE_108_144.txt (worker {wid})!", flush=True) break if __name__ == "__main__": n_cores = os.cpu_count() or 4 stop_event = mp.Event() total_counter = mp.Value('L', 0) procs = [mp.Process(target=worker, args=(i, stop_event, total_counter)) for i in range(n_cores)] for pr in procs: pr.start() print(f"Folyamatos keresés {n_cores} magon (deg 108/144, gcd=36, mod {P_MOD})...", flush=True) t0 = time.time() try: while not stop_event.is_set(): time.sleep(5) el = time.time() - t0 c = total_counter.value print(f" [{el:7.1f}s] Tesztelt (108,144) jelöltek: {c} ({c/max(el,1):.1f}/s)", flush=True) except KeyboardInterrupt: stop_event.set() for pr in procs: pr.join() Send back the complete code with all the fixes. Fix each of the listed errors one by one, 0 errors remaining. There must be exactly one file. Do not write anything else; just output the complete code, and it must not contain any comments. Never use simplified, to-do, dummy, simulated, or mock code. Write the entire file as complete, production-ready code in a single code block. If no list of errors is provided, you must find all the errors and fix them.
Response not available
Response not available