← All Duels

grok-4.20-0309-reasoning_vs_gemini-3.1-pro-preview.jsonl — 10 puzzles

grok-4.20-0309-reasoning
2
vs
gemini-3.1-pro-preview
1
#1 Solved
def mystery(x):
    if not isinstance(x, str):
        return False
    if not (x.isalpha() and x.islower()):
        return False
    h = 0
    for c in x:
        h = (h * 37 + ord(c)) % 1000003
    return h == 291624
"fvkpp"
"rumpelstiltskin"
Proposer: grok-4.20-0309-reasoning Solver: gemini-3.1-pro-preview
0 vs 0
#2 Solved
def mystery(x):
    if not isinstance(x, str):
        return False
    parts = x.split(',')
    if len(parts) != 2:
        return False
    try:
        u, v = int(parts[0]), int(parts[1])
    except ValueError:
        return False
    if u <= 0 or v <= 0:
        return False
    
    return u * u == 1 + 61 * v * v
"1766319049,226153980"
"1766319049,226153980"
Proposer: gemini-3.1-pro-preview Solver: grok-4.20-0309-reasoning
0 vs 0
#3 Solver Failed
def mystery(x):
    if not isinstance(x, str):
        return False
    if not (x.isalpha() and x.islower()):
        return False
    h = 0
    for c in x:
        h = (h * 131 + ord(c)) % 1000000007
    return h == 252220958
"aabrtz"
"cryptography"
Proposer: grok-4.20-0309-reasoning Solver: gemini-3.1-pro-preview
1 vs 0
#4 Solver Failed
def mystery(x):
    if not isinstance(x, str):
        return False
    
    octets = x.split('.')
    if len(octets) != 4:
        return False
        
    try:
        ip1, ip2, ip3, ip4 = map(int, octets)
    except ValueError:
        return False
        
    if min(ip1, ip2, ip3, ip4) <= 0:
        return False
        
    if ip1 + ip2 + ip3 + ip4 != 1150360008052520:
        return False
        
    if ip1**4 + ip2**4 + ip3**4 != ip4**4:
        return False
        
    return True
"95800670600.217520522633.414562901920.422483957367"
"95800000670600.217519001522633.414560002901920.422481002957367"
Proposer: gemini-3.1-pro-preview Solver: grok-4.20-0309-reasoning
1 vs 1
#5 Sample Solution Wrong
def mystery(x):
    if not isinstance(x, str):
        return False
    if not (x.isalpha() and x.islower()):
        return False
    h = 0
    for c in x:
        h = (h * 137 + ord(c)) % 1000000009
    return h == 942831393
"hardpuzzle"
Proposer: grok-4.20-0309-reasoning Solver: gemini-3.1-pro-preview
0 vs 1
#6 Sample Solution Wrong
def mystery(x):
    if not isinstance(x, str):
        return False
    
    parts = x.split('-')
    if len(parts) != 5:
        return False
        
    try:
        chunks = [int(p) for p in parts]
    except ValueError:
        return False
        
    if min(chunks) <= 0:
        return False
        
    # Check checksum
    if sum(chunks) != 498000003486:
        return False
        
    # Check cryptographic avalanche property (simplified)
    if chunks[0]**5 + chunks[1]**5 + chunks[2]**5 + chunks[3]**5 != chunks[4]**5:
        return False
        
    return True
"27000000189-84000000588-11000000770-13300000931-144000001008"
Proposer: gemini-3.1-pro-preview Solver: grok-4.20-0309-reasoning
0 vs 0
#7 Solver Failed
def mystery(x):
    if not isinstance(x, str):
        return False
    if not (x.isalpha() and x.islower()):
        return False
    h = 0
    for c in x:
        h = (h * 101 + ord(c)) % 1000000007
    return h == 953826660
"letmein"
"example"
Proposer: grok-4.20-0309-reasoning Solver: gemini-3.1-pro-preview
1 vs 0
#8 Solver Failed
def mystery(x):
    if not isinstance(x, str):
        return False
    
    parts = x.split('-')
    if len(parts) != 3:
        return False
        
    try:
        u, v, w = [int(p) for p in parts]
    except ValueError:
        return False
        
    if min(u, v, w) <= 10**10:
        return False
        
    if u**3 != v**3 + w**3 + 264:
        return False
        
    return True
** "569936821221962380720-569936821113563493509-472715493453327032"
"17732257950575056-17556810885724478-5472222937614080"
Proposer: gemini-3.1-pro-preview Solver: grok-4.20-0309-reasoning
1 vs 1
#9 Solver Failed
def mystery(x):
    if not isinstance(x, str):
        return False
    if not (x.isalpha() and x.islower()):
        return False
    h = 0
    for c in x:
        h = (h * 151 + ord(c)) % 1000000009
    return h == 941786918
"python"
"superdupersecret"
Proposer: grok-4.20-0309-reasoning Solver: gemini-3.1-pro-preview
2 vs 1
#10 Solved
def mystery(x):
    if not isinstance(x, str):
        return False
    
    parts = x.split(',')
    if len(parts) != 2:
        return False
        
    try:
        a, b = map(int, parts)
    except ValueError:
        return False
        
    if min(a, b) <= 10**14:
        return False
        
    if a**2 + 2*a*b - b**2 != 1:
        return False
        
    return True
"299713796309065,723573111879672"
"299713796309065,723573111879672"
Proposer: gemini-3.1-pro-preview Solver: grok-4.20-0309-reasoning
2 vs 1