{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu","formal_name":"MMLU","introduction":"MMLU asks four-way multiple-choice questions across 57 subjects, from elementary material to professional-level examinations. Since 2020 it has been the most widely cited single reference point for general capability.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/test","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"d5ec48ea-decb-54aa-b6b1-00942025d3c3","task_key":"all--test--d5ec48ea-decb-54aa-b6b1-00942025d3c3","task_revision_id":"1","upstream_id":"","short_description":"Many cryptographic protocols base their security on assumptions about the…","config":"all","split":"test","body":"{\"choices\":\"['integer multiplication is a function whose inverse, factorization, remains difficult for a large class of inputs', 'P = NP', 'even if P = NP, integer factorization is still likely not to be polynomial-time computable', 'testing primality is computationally intractable']\",\"question\":\"Many cryptographic protocols base their security on assumptions about the computational difficulty of integer factorization. Integer factorization serves this purpose because we believe that\",\"subject\":\"college_computer_science\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/test","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}