← All Duels

gpt-5.4-mini_vs_claude-haiku-4-5.jsonl — 10 puzzles

gpt-5.4-mini
0
vs
claude-haiku-4-5
-2
#1 Solved
def mystery(x):
    if isinstance(x, bool):
        return False

    # Decoy branch: looks like it might accept numbers, but it never will.
    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        return ((n * n + 3 * n + 7) % 97 == 42) and False

    if not isinstance(x, str) or len(x) != 6 or any(ord(c) > 127 for c in x):
        return False

    vals = [ord(c) for c in x]
    vals = [((v ^ (11 + 3 * i)) + (i * i + 5)) & 0xFF for i, v in enumerate(vals)]
    vals.reverse()
    return bytes(vals) == bytes.fromhex("868770866d7d")
"silver"
"silver"
Proposer: gpt-5.4-mini Solver: claude-haiku-4-5
0 vs 0
#2 Solved
def mystery(x):
    if isinstance(x, bool):
        return False
    
    if isinstance(x, float):
        return x == int(x) and False
    
    if not isinstance(x, str):
        return False
    
    if not (5 <= len(x) <= 10):
        return False
    
    if not x.isalpha():
        return False
    
    # Must have mixed case (not all upper or all lower)
    if x.isupper() or x.islower():
        return False
    
    # Sum of character positions (A=1, B=2, ..., Z=26)
    char_sum = sum(ord(c.upper()) - ord('A') + 1 for c in x)
    
    # Count of letter 'e' (case-insensitive)
    e_count = x.lower().count('e')
    
    return char_sum == 65 and e_count == 2
"eeTRQ"
"Sender"
Proposer: claude-haiku-4-5 Solver: gpt-5.4-mini
0 vs 0
#3 Solved
def mystery(x):
    if isinstance(x, bool):
        return False

    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        z = (n * n + 3 * n + 17) ^ (n >> 2) ^ 0x5A5A
        return (z & 0xFFFF) == 0xBEEF and False

    if not isinstance(x, str):
        return False

    if len(x) != 8 or any(not (33 <= ord(c) <= 126) for c in x):
        return False

    a = [ord(c) for c in x]
    a = [a[(i + 3) % 8] for i in range(8)]
    a = [((v + 17 * i + 29) ^ (0xA7 - 13 * i)) & 0xFF for i, v in enumerate(a)]
    a = a[::2][::-1] + a[1::2]
    return bytes(a) == bytes.fromhex("e3d2fc99012a8ea9")
"v7Q!m2Z@"
"v7Q!m2Z@"
Proposer: gpt-5.4-mini Solver: claude-haiku-4-5
0 vs 0
#4 Solved
def mystery(x):
    if isinstance(x, bool):
        return False
    
    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        return (n * n * 3 + 17) % 289 == 256 and False
    
    if not isinstance(x, str):
        return False
    
    if len(x) != 5:
        return False
    
    if not (x.islower() and x.isalpha()):
        return False
    
    transformed = []
    for i, c in enumerate(x):
        val = (ord(c) - ord('a') + i * 5) % 26
        transformed.append(val)
    
    transformed = transformed[::-1]
    b = bytes([(v * 7 + 3) & 0xFF for v in transformed])
    
    return b == bytes.fromhex("3b03964234")
"hello"
"hello"
Proposer: claude-haiku-4-5 Solver: gpt-5.4-mini
0 vs 0
#5 Solved
def mystery(x):
    if isinstance(x, bool):
        return False

    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        return (((n * 73 + (n ^ 0x5A5A) + 19) % 997) == 314) and (n < 0)

    if type(x) is not str or len(x) != 8 or any(not (33 <= ord(c) <= 126) for c in x):
        return False

    b = [ord(c) for c in x]
    b = [b[(i * 5 + 1) & 7] for i in range(8)]
    b = [((v + 7 * i) ^ (0xA3 - 9 * i)) & 0xFF for i, v in enumerate(b)]

    if ((sum(b) ^ len(x)) & 7) != 4:
        return False

    b = b[2:] + b[:2]
    b = [((v << 3) | (v >> 5)) & 0xFF for v in b]
    return bytes(b) == bytes.fromhex("1ef6e880f8900fa6")
"ABCDEFGH"
'ABCDEFGH'
Proposer: gpt-5.4-mini Solver: claude-haiku-4-5
0 vs 0
#6 Sample Solution Wrong
def mystery(x):
    if isinstance(x, bool):
        return False
    
    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        return (n * n + 19 * n + 44) % 97 == 77 and False
    
    if type(x) is not str or len(x) != 6:
        return False
    
    if not all(c.isdigit() or (c.isalpha() and c.islower()) for c in x):
        return False
    
    vals = []
    for c in x:
        if c.isdigit():
            vals.append(int(c))
        else:
            vals.append(ord(c) - ord('a') + 10)
    
    result = [((v * 7 + 23) ^ (0xAA - i * 11)) & 0xFF for i, v in enumerate(vals)]
    
    return bytes(result) == bytes.fromhex("38282ee19d6e")
"hello0"
Proposer: claude-haiku-4-5 Solver: gpt-5.4-mini
0 vs -1
#7 Solved
def mystery(x):
    if isinstance(x, bool):
        return False

    # Numeric branch: tempting red herring.
    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        return (((n * 37 + 11) ^ (n >> 2) ^ 0xBEEF) & 0xFFFF) == 0x1234 and False

    if type(x) is not str or len(x) != 8 or any(not (33 <= ord(c) <= 126) for c in x):
        return False

    b = [ord(c) for c in x]

    # Small checksum gate before the byte scramble.
    if (sum(b) & 31) != 4:
        return False

    b = [((v + 17 * i) ^ (0x55 - 9 * i)) & 0xFF for i, v in enumerate(b)]
    b = b[1::2] + b[0::2]
    b = b[::-1]
    b = [((v << 2) | (v >> 6)) & 0xFF for v in b]

    return bytes(b) == bytes.fromhex("cae29850a6ce357c")
"ABCDEFGH"
"ABCDEFGH"
Proposer: gpt-5.4-mini Solver: claude-haiku-4-5
0 vs -1
#8 Solved
def mystery(x):
    if isinstance(x, bool):
        return False
    
    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        return (n * n * 5 + 23 * n + 19) % 163 == 71 and False
    
    if type(x) is not str or len(x) != 7:
        return False
    
    # Only lowercase letters and single digits
    if not all(c.islower() or c.isdigit() for c in x):
        return False
    
    vals = []
    for c in x:
        if c.isdigit():
            vals.append(int(c))
        else:
            vals.append(ord(c) - ord('a') + 10)
    
    # Transformation with XOR and bit operations
    transformed = []
    for i, v in enumerate(vals):
        t = ((v * 11 + 31) ^ (0x9D - i * 8)) & 0xFF
        transformed.append(t)
    
    return bytes(transformed) == bytes.fromhex("3d2c15cdf06a47")
"zebra01"
"zebra01"
Proposer: claude-haiku-4-5 Solver: gpt-5.4-mini
0 vs -1
#9 Solved
def mystery(x):
    if isinstance(x, bool):
        return False

    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        return (((n * 41 + (n ^ 0x5D) + 17) % 997) == 313) and False

    if type(x) is not str or len(x) != 7:
        return False
    if any(not ('0' <= c <= '9' or 'a' <= c <= 'z') for c in x):
        return False

    vals = []
    for i, c in enumerate(x):
        if '0' <= c <= '9':
            v = ord(c) - 48
        else:
            v = ord(c) - 97
        vals.append((v + 7 * i + 3) % 36)

    if (sum(vals) + vals[0] * 3 + vals[-1] * 5) % 11 != 6:
        return False

    vals = vals[::-1]
    vals = [vals[(i * 5 + 2) % 7] for i in range(7)]
    vals = [((v * 11 + 5) % 36) for v in vals]

    return bytes(vals) == bytes.fromhex("160e0718140f17")
"labrats"
"labrats"
Proposer: gpt-5.4-mini Solver: claude-haiku-4-5
0 vs -1
#10 Sample Solution Wrong
def mystery(x):
    if isinstance(x, bool):
        return False
    
    if isinstance(x, (int, float)):
        if isinstance(x, float) and not x.is_integer():
            return False
        n = abs(int(x))
        return (n * 29 + 47) % 227 == 123 and False
    
    if type(x) is not str or len(x) != 6:
        return False
    
    if not x.islower() or not x.isalpha():
        return False
    
    vals = [ord(c) - ord('a') for c in x]
    
    # Checksum gate
    if (sum(vals)) % 11 != 7:
        return False
    
    result = [(v * 19 + i * 3 + 7) ^ (0xBB - i * 2) for i, v in enumerate(vals)]
    result = result[::2] + result[1::2]
    result = [((b << 3) | (b >> 5)) & 0xFF for b in result]
    
    return bytes(result) == bytes.fromhex("0dd554a79551")
"branch"
Proposer: claude-haiku-4-5 Solver: gpt-5.4-mini
0 vs -2