{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu-pro","formal_name":"MMLU-Pro","introduction":"MMLU-Pro rebuilds MMLU with ten answer options instead of four and removes items that no longer separate models. Questions span fourteen academic and professional subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","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":"f88ed82f-7020-5fb3-afa8-b252f1572948","task_key":"default--test--10637","task_revision_id":"1","upstream_id":"10637","short_description":"Let HH be a Merkle-Damgard hash function is H:X^{\\leq L} \\to TH:X^≤L →T.…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['Given H(k \\\\\\\\| m)H(k∥m) anyone can compute H(w \\\\\\\\| k \\\\\\\\| m \\\\\\\\| \\\\\\\\text{PB})H(w∥k∥m∥PB) for any ww', 'Given H(k \\\\\\\\| m)H(k∥m) anyone can compute H(k \\\\\\\\| m \\\\\\\\| w)H(k∥m∥w) for any ww', 'Given H(k \\\\\\\\| m)H(k∥m) anyone can compute H(k \\\\\\\\| m \\\\\\\\| \\\\\\\\text{PB} \\\\\\\\| w)H(k∥m∥PB∥w) for any ww', 'Anyone can compute H( k \\\\\\\\| m )H(k∥m) for any mm']\",\"question\":\"Let HH be a Merkle-Damgard hash function is H:X^{\\\\leq L} \\\\to TH:X^≤L  →T. Construct a MAC from this HH as follows: \\\\ \\\\ S(k,m) = H(k \\\\| m)  S(k,m)=H(k∥m). This mac is insecure because:\",\"src\":\"ori_mmlu-computer_security\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}