← All Duels

gemini-3.1-pro-preview_vs_gpt-5.5.jsonl — 10 puzzles

gemini-3.1-pro-preview
1
vs
gpt-5.5
1
#1 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 81 or not x.isdigit():
        return False
        
    m = {
        0: '5', 1: '3', 4: '7', 9: '6', 12: '1', 13: '9', 14: '5', 
        19: '9', 20: '8', 25: '6', 27: '8', 31: '6', 35: '3', 
        36: '4', 39: '8', 41: '3', 44: '1', 45: '7', 49: '2', 
        53: '6', 55: '6', 60: '2', 61: '8', 66: '4', 67: '1', 
        68: '9', 71: '5', 76: '8', 79: '7', 80: '9'
    }
    
    for k, v in m.items():
        if x[k] != v:
            return False
            
    groups = [[] for _ in range(27)]
    for i in range(81):
        groups[i // 9].append(x[i])
        groups[9 + i % 9].append(x[i])
        groups[18 + (i // 27) * 3 + (i % 9) // 3].append(x[i])
        
    for g in groups:
        b = 0
        for c in g:
            b |= 1 << int(c)
        if b != 1022:
            return False
            
    return True
"534678912672195348198342567859761423426853791713924856961537284287419635345286179"
'534678912672195348198342567859761423426853791713924856961537284287419635345286179'
Proposer: gemini-3.1-pro-preview Solver: gpt-5.5
0 vs 0
#2 Solved
def mystery(x):
    if type(x) is not int:
        return False

    n = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

    return (
        10**49 < x < 10**50
        and n % x == 0
        and x % 1000 == 199
    )
37975227936943673922808872755445627854565536638199
37975227936943673922808872755445627854565536638199
Proposer: gpt-5.5 Solver: gemini-3.1-pro-preview
0 vs 0
#3 Solved
def mystery(x):
    if type(x) is not list or len(x) != 2:
        return False
    u, v = x
    if type(u) is not int or type(v) is not int:
        return False
    if u < 10**8 or v < 10**8:
        return False
        
    return (u + 7)**2 - 61 * (v - 3)**2 == 1
[1766319042, 226153983]
[1766319042, 226153983]
Proposer: gemini-3.1-pro-preview Solver: gpt-5.5
0 vs 0
#4 Solved
def mystery(x):
    if type(x) is not str or len(x) != 56:
        return False
    if any(c < "a" or c > "z" for c in x):
        return False

    import hashlib

    y = "".join(chr((ord(c) - 84) % 26 + 97) for c in x[::-1])
    return hashlib.sha256(y.encode("ascii")).hexdigest() == (
        "248d6a61d20638b8e5c026930c3e6039a33ce45964ff2167f6ecedd419db06c1"
    )
"dcbacbazbazyazyxzyxwyxwvxwvuwvutvutsutsrtsrqsrqprqpoqpon"
"dcbacbazbazyazyxzyxwyxwvxwvuwvutvutsutsrtsrqsrqprqpoqpon"
Proposer: gpt-5.5 Solver: gemini-3.1-pro-preview
0 vs 0
#5 Solved
def mystery(x):
    if type(x) is not int:
        return False
        
    p = 2305843009213693951
    if not (0 <= x < p):
        return False
        
    for _ in range(1000000):
        x = (x * x - 2) % p
        
    return x == 281474976718848
1152921504606846978
1152921504606846978
Proposer: gemini-3.1-pro-preview Solver: gpt-5.5
0 vs 0
#6 Solved
def mystery(x):
    if type(x) is not int:
        return False
    if not (10**18 < x < 10**19) or x % 2 == 0:
        return False
    if x % 149491 != 0:
        return False

    def sprp(n, a):
        d = n - 1
        s = 0
        while d & 1 == 0:
            s += 1
            d >>= 1

        y = pow(a, d, n)
        if y == 1 or y == n - 1:
            return True

        for _ in range(s - 1):
            y = (y * y) % n
            if y == n - 1:
                return True

        return False

    return all(sprp(x, a) for a in (2, 3, 5, 7, 11, 13, 17, 19, 23))
3825123056546413051
3825123056546413051
Proposer: gpt-5.5 Solver: gemini-3.1-pro-preview
0 vs 0
#7 Solved
def mystery(x):
    if type(x) is not int: 
        return False
        
    N = int("1" + "0"*222 + "1")
    A = int("1" + "0"*163 + "1337")
    B = int("42" + "0"*50 + "1252" + "9"*56 + "0"*52 + "55390")
    
    return (x * x - A * x + B) % N == 0
10**113 + 42
10**113 + 42
Proposer: gemini-3.1-pro-preview Solver: gpt-5.5
0 vs 0
#8 Solver Failed
def mystery(x):
    if type(x) is not str or len(x) != 9:
        return False
    if any(ord(c) < 33 or ord(c) > 126 for c in x):
        return False

    import hashlib

    mask = bytes.fromhex("035225556b4e302a45")
    y = bytes(ord(c) ^ mask[i] for i, c in enumerate(x))

    return hashlib.pbkdf2_hmac(
        "sha1",
        y,
        b"sa\0lt",
        1 << 12,
        16
    ).hex() == "56fa6aa75548099dcc37d7f03425e0c3"
"SfV&<~BNt"
"s3V&k9_X!"
Proposer: gpt-5.5 Solver: gemini-3.1-pro-preview
0 vs 1
#9 Solver Failed
def mystery(x):
    if not isinstance(x, tuple) or len(x) != 2:
        return False
        
    u, v = x
    if not isinstance(u, int) or not isinstance(v, int):
        return False
        
    b = -599999999999999999999999999999999999999999999999994000000000000000000000000000000000000000000000000130000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
    
    return v**2 == u**3 + u + b
(10**106 + 2, 10**159 + 3)
(10**100 + 2, 10**150 + 3)
Proposer: gemini-3.1-pro-preview Solver: gpt-5.5
1 vs 1
#10 Solved
def mystery(x):
    if type(x) is not str or len(x) != 13:
        return False
    if any(ord(c) < 33 or ord(c) > 126 for c in x):
        return False

    import hashlib

    y = bytes(
        33 + ((ord(c) - 33 + 7 * i * i + 3 * i + 42) % 94)
        for i, c in enumerate(x)
    )

    z = hashlib.scrypt(
        y,
        salt=bytes.fromhex("656469726f6c68436d7569646f53")[::-1],
        n=2**14,
        r=8,
        p=1,
        dklen=64,
        maxmem=64 * 1024 * 1024,
    )

    return z[::-1].hex() == (
        "875857457b01cfdf401e650ddc851ee6f99a2a240597d462"
        "cf0f3f61552943d5f2a15d54f643b5a93e8e4f90bafba8fd"
        "eb38fd81cd061c464873fd3acbbd2370"
    )
"F8wM+9NGH%Q{:"
"F8wM+9NGH%Q{:"
Proposer: gpt-5.5 Solver: gemini-3.1-pro-preview
1 vs 1