← All Duels

gpt-5.5_vs_grok-4.20-0309-reasoning.jsonl — 10 puzzles

gpt-5.5
0
vs
grok-4.20-0309-reasoning
-1
#1 Solved
def mystery(x):
    if isinstance(x, bool):
        return False

    try:
        y = int(x)
    except (TypeError, ValueError, OverflowError):
        return False

    N = 114381625757888867669235779976146612010218296721242362562561842935706935245733897830597123563958705058989075147599290026879543541

    return 1 < y and y * y < N and N % y == 0
3490529510847650949147849619903898133417764638493387843990820577
3490529510847650949147849619903898133417764638493387843990820577
Proposer: gpt-5.5 Solver: grok-4.20-0309-reasoning
0 vs 0
#2 Sample Solution Wrong
def mystery(x):
    if isinstance(x, bool):
        return False
    try:
        y = int(x)
    except (TypeError, ValueError, OverflowError):
        return False
    N = 1329227995784915870021503298763226137
    return 1 < y and y * y < N and N % y == 0
576460752303423487
Proposer: grok-4.20-0309-reasoning Solver: gpt-5.5
0 vs -1
#3 Solved
def mystery(x):
    import hashlib

    if not isinstance(x, str) or len(x) != 43:
        return False

    try:
        b = x.encode("ascii")
    except UnicodeEncodeError:
        return False

    def flip(c):
        return c if c == 32 else 33 + ((c - 33 + 47) % 94)

    y = bytes(flip(b[(17 * i + 5) % 43]) for i in range(43))

    return hashlib.sha256(y).hexdigest() == (
        "d7a8fbb307d7809469ca9abcb0082e4f"
        "8d5651e46d3cdb762d02d0bf37c9e592"
    )
" ; 3F%J66AIH< @2E@F7C:9 CD ? B8K9G>@@465= "
" ; 3F%J66AIH< @2E@F7C:9 CD ? B8K9G>@@465= "
Proposer: gpt-5.5 Solver: grok-4.20-0309-reasoning
0 vs -1
#4 Solved
def mystery(x):
    if isinstance(x, bool):
        return False
    try:
        y = int(x)
    except (TypeError, ValueError, OverflowError):
        return False
    N = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139
    return 1 < y and y * y < N and N % y == 0
37975227936943673922808872755445627854565536638199
37975227936943673922808872755445627854565536638199
Proposer: grok-4.20-0309-reasoning Solver: gpt-5.5
0 vs -1
#5 Solved
def mystery(x):
    import hashlib

    if not isinstance(x, str) or len(x) != 24:
        return False

    try:
        b = x.encode("ascii")
    except UnicodeEncodeError:
        return False

    if any(c < 33 or c > 126 for c in b):
        return False

    n = 24
    out = bytearray()
    k = 23
    for i in range(n):
        j = (7 * i + 11) % n
        out.append(33 + ((b[j] - 33 + k) % 94))
        k = (k + 37) % 94

    salt = ((b"salt" + b"SALT") * 4) + b"salt"
    target = (
        "3d2eec4fe41c849b80c8d83662c0e44a"
        "8b291a964cf2f07038"
    )

    return hashlib.pbkdf2_hmac("sha1", bytes(out), salt, 4096, 25).hex() == target
"/pU=H9-lKBgYdi?*{T%+6{[Z"
"/pU=H9-lKBgYdi?*{T%+6{[Z"
Proposer: gpt-5.5 Solver: grok-4.20-0309-reasoning
0 vs -1
#6 Solved
def mystery(x):
    if isinstance(x, bool):
        return False
    try:
        y = int(x)
    except (TypeError, ValueError, OverflowError):
        return False
    N = (2**107 - 1) * (2**127 - 1)
    return 1 < y and y * y < N and N % y == 0
162259276829213363391578010288127
162259276829213363391578010288127
Proposer: grok-4.20-0309-reasoning Solver: gpt-5.5
0 vs -1
#7 Solved
def mystery(x):
    import hashlib

    if isinstance(x, bool):
        return False

    try:
        y = int(x)
    except (TypeError, ValueError, OverflowError):
        return False

    if not (0 <= y < (1 << 32)):
        return False

    nonce = y ^ 0xA5A5A5A5

    header = (
        (1).to_bytes(4, "little")
        + bytes(32)
        + bytes.fromhex(
            "4a5e1e4baab89f3a32518a88c31bc87f"
            "618f76673e2cc77ab2127b7afdeda33b"
        )[::-1]
        + (1231006505).to_bytes(4, "little")
        + (486604799).to_bytes(4, "little")
        + nonce.to_bytes(4, "little")
    )

    h = hashlib.sha256(hashlib.sha256(header).digest()).digest()[::-1].hex()

    return h == (
        "000000000019d6689c085ae165831e93"
        "4ff763ae46a2a6c172b3f1b60a8ce26f"
    )
3649964472
0xD98E09B8
Proposer: gpt-5.5 Solver: grok-4.20-0309-reasoning
0 vs -1
#8 Solved
def mystery(x):
    if isinstance(x, bool):
        return False
    try:
        y = int(x)
    except (TypeError, ValueError, OverflowError):
        return False
    N = (2**89 - 1) * (2**107 - 1)
    return 1 < y and y * y < N and N % y == 0
618970019642690137449562111
618970019642690137449562111
Proposer: grok-4.20-0309-reasoning Solver: gpt-5.5
0 vs -1
#9 Solved
def mystery(x):
    import hashlib
    import hmac

    if not isinstance(x, str) or len(x) != 28:
        return False

    try:
        b = x.encode("ascii")
    except UnicodeEncodeError:
        return False

    if any(c < 33 or c > 126 for c in b):
        return False

    msg = bytes((b[(11 * i + 5) % 28] ^ 0x5A) for i in range(28))
    key = bytes(c ^ 0x2A for c in b"`OLO")

    target = (
        "4338ec64b958ec9d8339279d083f005a"
        "c77595082624046a4e7560bf46c1dc5b"
    )

    return hmac.new(key, msg, hashlib.sha256).digest()[::-1].hex() == target
"44zz>-2(4#.=5<-523z.;ze.5;z;"
"44zz>-2(4#.=5<-523z.;ze.5;z;"
Proposer: gpt-5.5 Solver: grok-4.20-0309-reasoning
0 vs -1
#10 Solved
def mystery(x):
    if isinstance(x, bool):
        return False
    try:
        y = int(x)
    except (TypeError, ValueError, OverflowError):
        return False
    N = (2**61 - 1) * (2**89 - 1)
    return 1 < y and y * y < N and N % y == 0
2305843009213693951
2305843009213693951
Proposer: grok-4.20-0309-reasoning Solver: gpt-5.5
0 vs -1