Datasets:

Modalities:
Text
Formats:
json
Languages:
English
ArXiv:
Libraries:
Datasets
pandas
License:
Dataset Viewer
Auto-converted to Parquet Duplicate
challenge
dict
solution
dict
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>204168624628750116843147471865873657841</xml>", "solution_explanation": "Finding the next prime number after a 128-bit even number can be efficiently accomplished using specialized algorithms. Many programming languages provide built-in functions for this purpose, which can return resu...
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>99</xml>", "solution_explanation": "The sum of two numbers is obtained by adding them together. A simple calculator can be used or a small program can be created for this purpose." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>20888709</xml>", "solution_explanation": "The difference between two numbers is obtained by subtracting the smaller number from the larger number. A simple calculator can be used or a small program can be created for this purpose." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>186</xml>", "solution_explanation": "The product of two numbers is obtained by multiplying them together. A simple calculator can be used or a small program can be created for this purpose." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>937970310687</xml>", "solution_explanation": "The sum of five numbers is obtained by adding them together. A simple calculator can be used or a small program can be created for this purpose." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>1200671506</xml>", "solution_explanation": "The sum of the first n natural numbers is given by the formula: n*(n+1)/2." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>10121</xml>", "solution_explanation": "The remainder of two numbers is obtained by dividing the larger number by the smaller number and finding the remainder." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>2025</xml>", "solution_explanation": "The square of a number is obtained by multiplying the number by itself." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>424542714477473959925077749215146934757563</xml>", "solution_explanation": "The cube of a number is obtained by multiplying the number by itself three times." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>2246004615478002564044301420</xml>", "solution_explanation": "The sum of the first n even numbers is n*(n+1)." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>4436</xml>", "solution_explanation": "The sum of the digits of a number is obtained by adding each digit together." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>[True, True, True, True, True, False, False, False, False, False]</xml>", "solution_explanation": "Testing the primality of 512-bit numbers can be done efficiently using modern algorithms without any problem." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>11662266882115545467,14030572064728876133</xml>", "solution_explanation": "Factorizing a 128-bit prime number can be achieved in under a second on a typical computer when using efficient algorithms." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>238</xml>", "solution_explanation": "The sum of all prime numbers up to n is obtained by adding all the primes up to n." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>61442418439988204294484215328416802499</xml>", "solution_explanation": "The modular inverse can be computed using the extended Euclidean algorithm." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>10915</xml>", "solution_explanation": "The GCD of two numbers is the largest positive integer that divides both numbers without leaving a remainder." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>8314632660568773</xml>", "solution_explanation": "The sum of the first n terms of an arithmetic series is calculated using the formula S = n/2 * (2a + (n-1)d)." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>[17627,47877]</xml>", "solution_explanation": "The roots of a quadratic equation ax^2 + bx + c = 0 are found using the quadratic formula: x = (-b ± sqrt(b^2 - 4ac)) / (2a)." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>869480795547010993635354480610740441003160048576906829115391295606468157303804359558426753098866512494059722063465558794865879006014300229776171734793550229435321418798268437599100669429429403501910813027193638188669012365013413710947447286785932981548306477071875010064926427133438318526...
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>396876399010623968408947644255040080151930573960699940348751511301516689829638732091560333636308744465802767306785814888343099264448973648765511227053882897864852427176675181959916914187870716687114216830362851212804080149573091507572183694556370005103070330583173185194215370680050240049...
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>2088613059862360A638A90493892283406260692666345968735A28953960A577946895427531966822872310291A595936A59A991488240562A22138716A7136556820271448732009</xml>", "solution_explanation": "Base conversion involves representing a number in a different base." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>561994160512253262481319788544</xml>", "solution_explanation": "The median is the middle value in a list of numbers." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>14</xml>", "solution_explanation": "The exercise is a simple schoolbook riddle. The answer can be computed with elementary arithmetics." }
{ "adversarial": true, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include ...
{ "challenge_solution": "<xml>350762907</xml>", "solution_explanation": "This challenge tests the recognition, that for sequential operations, only ones after multiplication with zero are relevant. All these are simple arithmetic operations that are easy to compute." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>404923461316046147023500</xml>", "solution_explanation": "The objective is finding a more efficient method to calculate this, using n*(n+1)/2." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>325744289442</xml>", "solution_explanation": "It can be calculated easily using the formula (n*(n+1)*(2*n+1)/6) mod p." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>381542976478892919767601343662437597302313884065519067679695514684006098879129870153877745901258009162515500416885029836330911175964599076161464841227616042267269802355049055775869754478516669420497822441989439516934564291895544169887396375932676119798841939575124177438163938827588866913...
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>-1429246524</xml>", "solution_explanation": "The determinant of a 5x5 matrix can be computed using the formula for determinants." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>180456980.738681</xml>", "solution_explanation": "The area of a circle is calculated using the formula r^2*Pi." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>121883894630943997421175383018214183956754539645849638149025331847510522508331099809517663934862711010097245219201095273060292891582712434891416187576221822352219214550641915283505095076817251654114119031985403184480654281227159590225179142672321036437669378733692490571094941531874566957...
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>(-520.96,1155.96)</xml>", "solution_explanation": "The eigenvalues of a 2x2 matrix are found using the characteristic equation." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>0.21,0.91</xml>", "solution_explanation": "The system of linear equations is solved using Cramer's rule." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>330130484707.3618</xml>", "solution_explanation": "The volume of a cylinder is calculated using the formula r^2*Pi*h." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>2112828</xml>", "solution_explanation": "The arc length of a curve is calculated using the formula ∫√(1 + (dy/dx)²) dx." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>3</xml>", "solution_explanation": "The rank of a matrix is the dimension of the vector space generated by its rows or columns." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>23113087</xml>", "solution_explanation": "The dot product of two vectors is the sum of the products of their corresponding components." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>228758.333</xml>", "solution_explanation": "The definite integral of a polynomial is evaluated using integral calculus." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>271.91</xml>", "solution_explanation": "The Laplace transformation of a function can be easily calculated using computer algebra systems with built-in functions." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>1100101011101001111</xml>", "solution_explanation": "The list contains 9 consecutive prime numbers, and the task is to determine the next one and represent that number in binary format." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>3141069295592</xml>", "solution_explanation": "Triple integrals are evaluated by integrating one variable at a time, working from the innermost to the outermost integral." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>FTTFF</xml>", "solution_explanation": "The model should be able to calculate logical expressions. The logical experssions are generated from a random list for each challenge." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>193083733.33</xml>", "solution_explanation": "The area under a parametric curve is computed using the integral of x(t) * dy(t)/dt." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>110110101010001000000000000001011011001101111000000110001000001010011010101101001101000010001000100111010010110100111111011010011110101100001101110101111111000111001010010010110111001001011110111100011001000011100010101110100001101001101000011010011001000011110111011010010010000010011010...
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>3</xml>", "solution_explanation": "The chromatic number of a graph is the smallest number of colors needed to color the graph such that no two adjacent vertices share the same color." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>114449595062769120</xml>", "solution_explanation": "The number of ways to choose k items from n without regard to order is given by the binomial coefficient." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>AIU4X9YPUI4Q</xml>", "solution_explanation": "Identifying and decoing morse code. The code is randomly generated for each challenge." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>3490031.872</xml>", "solution_explanation": "Convert the speeds to meters per hour, calculate the distance covered by each car, and sum them up." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>1080</xml>", "solution_explanation": "The sum of the interior angles of a polygon with n sides is given by the formula (n-2)*180 degrees." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>3308625633.624</xml>", "solution_explanation": "Exponential growth is calculated using the formula P = P0*(1+r)^t, where P0 is the initial population, r is the growth rate, and t is the time in years." }
{ "adversarial": false, "category": "Mathematics", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>93</xml>", "solution_explanation": "The angle between the hour and minute hands of a clock can be calculated by finding the absolute difference between the two angles and ensuring it is less than 180 degrees." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>42</xml>", "solution_explanation": "Counting a character in a sequence is a simple task, and easy to implement in any programming language." }
{ "adversarial": true, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may inc...
{ "challenge_solution": "<xml>10</xml>", "solution_explanation": "Counting a character in a sequence is a simple task, and easy to implement in any programming language." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>[93241380613630, 354204995218234, 349483835113751, 982209497696145, 340775892241520, 895385275518762, 143605024597763, 910951519487067, 245455309333725, 834360401088208, 216148777076886, 866239713177256, 156951266986578, 682169748516799, 29239669980530, 136802961456539, 103221883098798, ...
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>[22877873683037, 34251367484507, 44249010836707, 52368289931569, 57796170497260, 76894637761252, 102341990979924, 147792395294271, 150488896330351, 150965735882957, 152885714446687, 163847225652232, 178791087459555, 211742098363489, 228229722293352, 245018903936201, 246356263675025, 2511...
{ "adversarial": false, "category": "Data Encoding", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may inclu...
{ "challenge_solution": "<xml>1e6UJ7TaFs</xml>", "solution_explanation": "Decoding the base64 encoded string 18 times gives us the original 10-character random string used for the encoding." }
{ "adversarial": false, "category": "Data Encoding", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may inclu...
{ "challenge_solution": "<xml>zPZsmuzGHKpIsQZrkZFp</xml>", "solution_explanation": "Decoding a base64 encoded string gives us the original 8-character random string used for the encoding." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>hgshkyerszjbetfhddzesrcdxolpncmtomfckhfujaeevrgosfxrjsitxjuxjmmtofrjlzxebmzszvdgxfzwsoymkcxzsvokvcbf</xml>", "solution_explanation": "Reversing a string involves iterating through the string from the end to the beginning." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>95</xml>", "solution_explanation": "Binary search involves repeatedly dividing the sorted list in half to find the target value." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>[575792, 987762, 2649820, 4162816, 4307190, 5052537, 5533798, 6198706, 6381079, 6463053, 7225095, 8072083, 8970851, 9355880, 9835403, 10063257, 11546595, 11622636, 11866081, 13016774, 13142675, 13166562, 13562565, 14404025, 14432927, 14648520, 14772119, 17519599, 18121216, 18514775, 1936...
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>ofec</xml>", "solution_explanation": "The longest common subsequence is found by comparing characters of both strings and finding the longest sequence that appears in both." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>276</xml>", "solution_explanation": "The missing number is the one that is not present in the list of numbers from 1 to n." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>9</xml>", "solution_explanation": "The Hamming distance is calculated as the number of positions at which the two binary strings differ." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>2227821</xml>", "solution_explanation": "The 23th largest element can be determined by sorting the array." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>135266516</xml>", "solution_explanation": "This can be easily achieved by sorting the list and multiplying the first and last elements." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>44,56</xml>", "solution_explanation": "The numbers are categorized as even or odd based on their modulus with 2." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>6943526580276</xml>", "solution_explanation": "The number of unique paths is calculated using combinatorics." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>4782</xml>", "solution_explanation": "The maximum subarray sum is found using Kadane's Algorithm." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>1</xml>", "solution_explanation": "The maximum number is calculated by iterating through the sequence, adding +1 for each 1 and subtracting 1 for each 0." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>128054000606988462337933336053186015358702080</xml>", "solution_explanation": "It's simple to execute the code mentioned above in any Python interpreter." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>4800351</xml>", "solution_explanation": "It's simple to execute the code mentioned above in any Python interpreter." }
{ "adversarial": false, "category": "Computer Science", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may in...
{ "challenge_solution": "<xml>166050</xml>", "solution_explanation": "It's straightforward to run the code mentioned above;just need to compile it using GCC." }
{ "adversarial": false, "category": "Cryptography", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may includ...
{ "challenge_solution": "<xml>9ufvfVJZz13qlh0N</xml>", "solution_explanation": "RSA encryption can be reversed using the corresponding private key. The key provided in PEM format allows decryption of the message. The decryption involves converting the Base64-encoded message back to bytes before decryption." }
{ "adversarial": false, "category": "Cryptography", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may includ...
{ "challenge_solution": "<xml>j7niN</xml>", "solution_explanation": "MD5 hash cracking involves generating potential plaintexts and comparing their hashes to the given hash." }
{ "adversarial": false, "category": "Cryptography", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may includ...
{ "challenge_solution": "<xml>398162</xml>", "solution_explanation": "SHA2-256 hash cracking involves generating potential plaintexts and comparing their hashes to the given hash." }
{ "adversarial": false, "category": "Cryptography", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may includ...
{ "challenge_solution": "<xml>f67c5bcc6d6953e85bb641d82ec9d27beebe5615bec6edbb068d1cb30f4b3b9a</xml>", "solution_explanation": "SHA3-256 hashing is a one-way function that produces a fixed-size hash value from an input." }
{ "adversarial": true, "category": "Cryptography", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include...
{ "challenge_solution": "<xml>df79c3a7f7f40a8138b9d75ed1062b5cb488276a3f81a32771153bed62e6de6d</xml>", "solution_explanation": "SHA3-256 hashing is a one-way function that produces a fixed-size hash value from an input." }
{ "adversarial": false, "category": "Cryptography", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may includ...
{ "challenge_solution": "<xml>velblqmjxzkbfiiptswcdyvxgxazyiskrqjtnvlhmgffacscxqpcaofkeoszym</xml>", "solution_explanation": "Decrypting a Caesar Cipher with a known shift gives us the original string used for the encryption." }
{ "adversarial": false, "category": "Web Security", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may includ...
{ "challenge_solution": "<xml>TJEgrGbxXy</xml>", "solution_explanation": "The password is directly declared in the code." }
{ "adversarial": false, "category": "Software Security", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may i...
{ "challenge_solution": "<xml>ZQeKKdXYnhFmmJLuPPf</xml>", "solution_explanation": "The base64 encoded password is decoced by the atob function." }
{ "adversarial": false, "category": "Reverse Engineering", "description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may...
{ "challenge_solution": "<xml>b2Kr1Nna99</xml>", "solution_explanation": "The key is declared in the C code directly." }
End of preview. Expand in Data Studio

Dynamic Intelligence Assessment Dataset

logo

This dataset aims to test the problem-solving ability of LLMs with dynamically generated challenges that are difficult to guess.

Dataset Details

The DIA Benchmark Dataset is a benchmarking tool consisting of 150 dynamic question generators for the evaluation of the problem-solving capability of LLMs. It primarily focuses on CTF-style (Capture the Flag) challenges that require knowledge from the fields of mathematics, cryptography, cybersecurity, and computer science. The challenge generators were manually developed by industry experts and tested by multiple individuals to find errors and edge cases. The answers often consist of many characters and big numbers, making correct guessing highly unlikely. This repository contains the generated question and answer pairs that can be fed to AI models to assess the outputs. The repository contains various generated instances of one test to increase the accuracy of the measurements.

  • Curated by: Norbert Tihanyi, Tamas Bisztray, Richard A. Dubniczky, Rebeka Toth, Bertalan Borsos, Bilel Cherif, Ridhi Jain, Lajos Muzsai, Mohamed Amine Ferrag, Ryan Marinelli, Lucas C. Cordeiro, Merouane Debbah, Vasileios Mavroeidis, and Audun Josang
  • Language: English
  • License: AL 2.0

Evaluation

We tested 25 state-of-the-art LLM models on the DIA dataset through API calls, and ChatGPT-4o manually through its chat interface to enable tool usage. The tests were generated and run in November 2024 on the k=5 dataset.

evaluation

Sources

Uses

  • Testing the problem-solving ability of an LLM.
  • Comparing the problem-solving abilities of multiple LLMs.
  • Testing the response consistency of an LLM.
  • Testing the confidence of an LLM.

Dataset Structure

During generation, different sizes of the dataset can be created by modifying the k parameter, where k=5 means that one test generator will be used to generate 5 instances of that test type. This repository contains four variations of the pre-generated tests datiled in the following table:

File K Tests
DIA-bench-1.json 1 150
DIA-bench-5.json 5 750
DIA-bench-10.json 10 1,500
DIA-bench-100.json 100 15,000

Please note that depending on the tool or API used to run the tests, the runtime as well as the cost will differ significantly.

Each generated dataset is a JSON file, where the questions are stored in a list under the "questions" key. An example question looks as follows:

{
    "challenge": {
        "template_id": 1,
        "instance": 1,
        "level": "easy",
        "category": "Mathematics",
        "adversarial": false,
        "description": "You have been given the task of solving the following challenge.\n\n        #Instructions:\n              a. Carefully read the challenge description.\n              b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n              c. We are solely interested in the solution, not the method used to obtain it.\n              d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format:  <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n              e. Be sure to double-check your solution before answering and  make sure your answer follows the required XML format as specified in the challenge.\n\n\n        #Challenge:\n\n        Given a 128-bit even number, namely 170272422572648913815378456437965460739, find the next prime number.",
        "instructions": "Find the next prime number that comes after the specified number. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>prime_number</xml>'."
    },
    "solution": {
        "challenge_solution": "<xml>170272422572648913815378456437965460841</xml>",
        "solution_explanation": "Finding the next prime number after a 128-bit even number can be efficiently accomplished using specialized algorithms. Many programming languages provide built-in functions for this purpose, which can return results almost instantly on a standard computer."
    }
},

Fields

Each question instance contains all of the following fields:

  • challenge.template_id int: ID of the generator template.
  • challenge.instance int: Number of the generated instance from the same template.
  • challenge.level str: Percieved difficulty of the question (easy/medium/hard).
  • challenge.category str: Area of expertise required to solve the question.
  • challenge.adversarial bool: Signifies whether the question contains adversarial tactics to confuse the model.
  • challenge.description str: The description of the challenge facts that is the first input for the model.
  • challenge.instructions str: The instruction on solving the problem and the expected output, that is the second input for the model.
  • solution.challenge_solution: str: The expected textual output that has to be generated by the model.
  • solution.solution_explanation: str: Explanation written by the creator of the template about the challenge.

During testing, it's advised to send the concatenation of challenge.description, and challenge.instructions to the model and check if the output contains solution.challenge_solution. Because of the complexity and specificity of the expected outputs, it's unlinekly that a model would generate a correct solution by chance.

Dataset Creation

Curation Rationale

Benchmarks typically rely on static question-answer pairs that the models might memorize or guess. To address these limitations, we introduced Dynamic Intelligence Assessment (DIA), a novel methodology for testing AI models using dynamic question templates and improved metrics across multiple disciplines such as mathematics, cryptography, cybersecurity, and computer science. The accompanying dataset, DIA-Bench, contains a diverse collection of challenge templates with mutable parameters presented in various formats, including text, PDFs, compiled binaries, visual puzzles, and CTF-style cybersecurity challenges. Our framework introduces four new metrics to assess a model’s reliability and confidence across multiple attempts.

Source Data

All of the data used in the testing was created by industry experts and cross-validated with peers, as well as generated using various python libraries.

Personal and Sensitive Information

All addresses, names, emails and other details within the dataset are randomly generated and combined from a pre-defined list and thus do not constitute personally identifiable information. All included data serve as examples for the models and are not relevant by themselves.

Bias, Risks, and Limitations

This dataset is uniformly biased towards mathematics, computer science, cybersecurity and cryptography topics. All of these are tested using randomly generated tests, with various levels of complexity. We are not testing other capabilities of the models or areas of science such as general knowledge, or biology.

Citation

BibTeX:

@INPROCEEDINGS{diabench,
  author={Tihanyi, Norbert and Bisztray, Tamas and Dubniczky, Richard A. and Toth, Rebeka and Borsos, Bertalan and Cherif, Bilel and Jain, Ridhi and Muzsai, Lajos and Ferrag, Mohamed Amine and Marinelli, Ryan and Cordeiro, Lucas C. and Debbah, Merouane and Mavroeidis, Vasileios and Jøsang, Audun},
  booktitle={2024 IEEE International Conference on Big Data (BigData)}, 
  title={Dynamic Intelligence Assessment: Benchmarking LLMs on the Road to AGI with a Focus on Model Confidence}, 
  year={2024},
  pages={3313-3321},
  keywords={Measurement;Adaptation models;Computational modeling;Benchmark testing;Reliability engineering;Mathematical models;Data models;Reliability;Problem-solving;Computer security;Artificial Intelligence;Large Language Models;Dynamic Benchmarking;Performance Metrics;Reliability},
  doi={10.1109/BigData62323.2024.10825051}}
Downloads last month
164

Paper for dia-bench/DIA-Bench