Upload e1_results_v2.json with huggingface_hub

e1_results_v2.json

@@ -14,14 +14,14 @@
   "valid_block_rate": 0.909,
   "n_blocks": 1.182,
   "total_denoisings": 1.182,
-  "wall_s": 2.467
+  "wall_s": 2.107
  },
  "verified": {
   "final_valid": 1.0,
   "valid_block_rate": 0.977,
   "n_blocks": 1.182,
   "total_denoisings": 1.5,
-  "wall_s": 3.095
+  "wall_s": 2.647
  },
  "tasks": [
   {
@@ -31,7 +31,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 7.53,
+    "wall_s": 7.08,
     "code": "from collections import OrderedDict\n\nclass LRUCache:\n    def __init__(self, capacity: int):\n        self.capacity = capacity\n        self.cache = OrderedDict()\n\n    def get(self, key: int) -> int:\n        if key not in self.cache:\n            return -1\n        self.cache.move_to_end(key)\n        return self.cache[key]\n\n    def put(self, key: int, value: int) -> None:\n        if key in self.cache:\n            self.cache.move_to_end(key)\n        self.cache[key] = value\n        if len(self.cache) > self.capacity:\n            self.cache.popitem(last=False)"
    },
    "verified": {
@@ -39,7 +39,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.68,
+    "wall_s": 1.3,
     "code": "from collections import OrderedDict\n\nclass LRUCache:\n    def __init__(self, capacity: int):\n        self.capacity = capacity\n        self.cache = OrderedDict()\n\n    def get(self, key: int) -> int:\n        if key not in self.cache:\n            return -1\n        self.cache.move_to_end(key)\n        return self.cache[key]\n\n    def put(self, key: int, value: int) -> None:\n        if key in self.cache:\n            self.cache.move_to_end(key)\n        self.cache[key] = value\n        if len(self.cache) > self.capacity:\n            self.cache.popitem(last=False)"
    }
   },
@@ -50,7 +50,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.29,
+    "wall_s": 1.0,
     "code": "class BankAccount:\n    def __init__(self, initial_balance=0):\n        self._balance = initial_balance\n\n    @property\n    def balance(self):\n        return self._balance\n\n    def deposit(self, amount):\n        if amount <= 0:\n            raise ValueError(\"Deposit amount must be positive\")\n        self._balance += amount\n\n    def withdraw(self, amount):\n        if amount <= 0:\n            raise ValueError(\"Withdrawal amount must be positive\")\n        if amount > self._balance:\n            raise ValueError(\"Insufficient funds\")\n        self._balance -= amount\n\n    def __repr__(self):\n        return f\"BankAccount(balance={self._balance})\""
    },
    "verified": {
@@ -58,7 +58,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.28,
+    "wall_s": 1.0,
     "code": "class BankAccount:\n    def __init__(self, initial_balance=0):\n        self._balance = initial_balance\n\n    @property\n    def balance(self):\n        return self._balance\n\n    def deposit(self, amount):\n        if amount <= 0:\n            raise ValueError(\"Deposit amount must be positive\")\n        self._balance += amount\n\n    def withdraw(self, amount):\n        if amount <= 0:\n            raise ValueError(\"Withdrawal amount must be positive\")\n        if amount > self._balance:\n            raise ValueError(\"Insufficient funds\")\n        self._balance -= amount\n\n    def __repr__(self):\n        return f\"BankAccount(balance={self._balance})\""
    }
   },
@@ -69,7 +69,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 2,
     "total_denoisings": 2,
-    "wall_s": 2.85,
+    "wall_s": 2.19,
     "code": "import re\n\ndef evaluate(expr: str) -> float:\n    tokens = re.findall(r'\\d+\\.?\\d*|[+\\-*/()-()]', expr)\n    pos = 0\n\n    def peek():\n        return tokens[pos] if pos < len(tokens) else None\n\n    def consume():\n        nonlocal pos\n        token = peek()\n        pos += 1\n        return token\n\n    def expression():\n        node = term()\n        while peek() in ('+', '-'):\n            op = consume()\n            right = term()\n            if op == '+':\n                node += right\n            else:\n                node -= right\n        return node\n\n    def term():\n        node = factor()\n        while peek() in ('*', '/'):\n            op = consume()\n            right = factor()\n            if op == '*':\n                node *= right\n            else:\n                node /= right\n        return node\n\n    def factor():\n        token = consume()\n        if token == '(':\n            result = expression()\n            consume()  # consume ')'\n            return result\n        return float(token)\n\n    return expression()"
    },
    "verified": {
@@ -77,7 +77,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 2,
     "total_denoisings": 2,
-    "wall_s": 2.84,
+    "wall_s": 2.19,
     "code": "import re\n\ndef evaluate(expr: str) -> float:\n    tokens = re.findall(r'\\d+\\.?\\d*|[+\\-*/()-()]', expr)\n    pos = 0\n\n    def peek():\n        return tokens[pos] if pos < len(tokens) else None\n\n    def consume():\n        nonlocal pos\n        token = peek()\n        pos += 1\n        return token\n\n    def expression():\n        node = term()\n        while peek() in ('+', '-'):\n            op = consume()\n            right = term()\n            if op == '+':\n                node += right\n            else:\n                node -= right\n        return node\n\n    def term():\n        node = factor()\n        while peek() in ('*', '/'):\n            op = consume()\n            right = factor()\n            if op == '*':\n                node *= right\n            else:\n                node /= right\n        return node\n\n    def factor():\n        token = consume()\n        if token == '(':\n            result = expression()\n            consume()  # consume ')'\n            return result\n        return float(token)\n\n    return expression()"
    }
   },
@@ -88,7 +88,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 2,
     "total_denoisings": 2,
-    "wall_s": 1.84,
+    "wall_s": 1.42,
     "code": "from dataclasses import dataclass\nimport math\n\n@dataclass(frozen=True)\nclass Vector3:\n    x: float\n    y: float\n    z: float\n\n    def __add__(self, other: 'Vector3') -> 'Vector3':\n        return Vector3(self.x + other.x, self.y + other.y, self.z + other.z)\n\n    def __mul__(self, scalar: float) -> 'Vector3':\n        return Vector3(self.x * scalar, self.y * scalar, self.z * scalar)\n\n    def dot(self, other: 'Vector3') -> float:\n        return self.x * other.x + self.y * other.y + self.z * other.z\n\n    def cross(self, other: 'Vector3') -> 'Vector3':\n        return Vector3(\n            self.y * other.z - self.z * other.y,\n            self.z * other.x - self.x * other.z,\n            self.x * other.y - self.y * other.x\n        )\n\n    def norm(self) -> float:\n        return math.sqrt(self.dot(self))"
    },
    "verified": {
@@ -96,7 +96,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 2,
     "total_denoisings": 2,
-    "wall_s": 1.85,
+    "wall_s": 1.43,
     "code": "from dataclasses import dataclass\nimport math\n\n@dataclass(frozen=True)\nclass Vector3:\n    x: float\n    y: float\n    z: float\n\n    def __add__(self, other: 'Vector3') -> 'Vector3':\n        return Vector3(self.x + other.x, self.y + other.y, self.z + other.z)\n\n    def __mul__(self, scalar: float) -> 'Vector3':\n        return Vector3(self.x * scalar, self.y * scalar, self.z * scalar)\n\n    def dot(self, other: 'Vector3') -> float:\n        return self.x * other.x + self.y * other.y + self.z * other.z\n\n    def cross(self, other: 'Vector3') -> 'Vector3':\n        return Vector3(\n            self.y * other.z - self.z * other.y,\n            self.z * other.x - self.x * other.z,\n            self.x * other.y - self.y * other.x\n        )\n\n    def norm(self) -> float:\n        return math.sqrt(self.dot(self))"
    }
   },
@@ -107,7 +107,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 3.42,
+    "wall_s": 2.66,
     "code": "import functools\n\ndef retry(times, exceptions):\n    def decorator(func):\n        @functools.wraps(func)\n        def wrapper(*args, **kwargs):\n            last_exception = None\n            for i in range(times):\n                try:\n                    return func(*args, **kwargs)\n                except exceptions as e:\n                    last_exception = e\n                    print(f\"Attempt {i + 1} failed: {e}\")\n            raise last_exception\n        return wrapper\n    return decorator\n\n@retry(times=3, exceptions=(ValueError, ZeroDivisionError))\ndef unstable_function(n):\n    import random\n    if random.random() < 0.7:\n        raise ValueError(\"Random failure occurred\")\n    return n * 2\n\nif __name__ == \"__main__\":\n    try:\n        result = unstable_function(10)\n        print(f\"Result: {result}\")\n    except ValueError as e:\n        print(f\"Function failed after all retries: {e}\")"
    },
    "verified": {
@@ -115,7 +115,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 3.42,
+    "wall_s": 2.63,
     "code": "import functools\n\ndef retry(times, exceptions):\n    def decorator(func):\n        @functools.wraps(func)\n        def wrapper(*args, **kwargs):\n            last_exception = None\n            for i in range(times):\n                try:\n                    return func(*args, **kwargs)\n                except exceptions as e:\n                    last_exception = e\n                    print(f\"Attempt {i + 1} failed: {e}\")\n            raise last_exception\n        return wrapper\n    return decorator\n\n@retry(times=3, exceptions=(ValueError, ZeroDivisionError))\ndef unstable_function(n):\n    import random\n    if random.random() < 0.7:\n        raise ValueError(\"Random failure occurred\")\n    return n * 2\n\nif __name__ == \"__main__\":\n    try:\n        result = unstable_function(10)\n        print(f\"Result: {result}\")\n    except ValueError as e:\n        print(f\"Function failed after all retries: {e}\")"
    }
   },
@@ -126,7 +126,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 2.27,
+    "wall_s": 1.77,
     "code": "import asyncio\nimport httpx\nfrom typing import List, Any\n\nasync def fetch_url(url: str, semaphore: asyncio.Semaphore, client: httpx.AsyncClient) -> Any:\n    async with semaphore:\n        response = await client.get(url)\n        return response.text\n\nasync def fetch_all(urls: List[str]) -> List[Any]:\n    semaphore = asyncio.Semaphore(5)\n    async with httpx.AsyncClient() as client:\n        tasks = [fetch_url(url, semaphore, client) for url in urls]\n        results = await asyncio.gather(*tasks)\n        return list(results)"
    },
    "verified": {
@@ -134,7 +134,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 2.28,
+    "wall_s": 1.76,
     "code": "import asyncio\nimport httpx\nfrom typing import List, Any\n\nasync def fetch_url(url: str, semaphore: asyncio.Semaphore, client: httpx.AsyncClient) -> Any:\n    async with semaphore:\n        response = await client.get(url)\n        return response.text\n\nasync def fetch_all(urls: List[str]) -> List[Any]:\n    semaphore = asyncio.Semaphore(5)\n    async with httpx.AsyncClient() as client:\n        tasks = [fetch_url(url, semaphore, client) for url in urls]\n        results = await asyncio.gather(*tasks)\n        return list(results)"
    }
   },
@@ -145,7 +145,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.43,
+    "wall_s": 1.1,
     "code": "def sliding_window(iterable, n):\n    it = iter(iterable)\n    window = []\n    for _ in range(n):\n        try:\n            window.append(next(it))\n        except StopIteration:\n            return\n    yield tuple(window)\n    for item in it:\n        window.pop(0)\n        window.append(item)\n        yield tuple(window)\n\ndef flatten(nested):\n    for item in nested:\n        if isinstance(item, (list, tuple)):\n            yield from flatten(item)\n        else:\n            yield item"
    },
    "verified": {
@@ -153,7 +153,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.44,
+    "wall_s": 1.13,
     "code": "def sliding_window(iterable, n):\n    it = iter(iterable)\n    window = []\n    for _ in range(n):\n        try:\n            window.append(next(it))\n        except StopIteration:\n            return\n    yield tuple(window)\n    for item in it:\n        window.pop(0)\n        window.append(item)\n        yield tuple(window)\n\ndef flatten(nested):\n    for item in nested:\n        if isinstance(item, (list, tuple)):\n            yield from flatten(item)\n        else:\n            yield item"
    }
   },
@@ -164,7 +164,7 @@
     "valid_block_rate": 0.5,
     "n_blocks": 2,
     "total_denoisings": 2,
-    "wall_s": 2.53,
+    "wall_s": 1.99,
     "code": "def merge_sort(xs):\n    \"\"\"\n    Sorts a list using the merge sort algorithm.\n    \n    Args:\n        xs (list): A list of comparable elements.\n        \n    Returns:\n        list: A new list containing the elements in ascending order.\n    \"\"\"\n    if len(xs) <= 1:\n        return xs\n    \n    mid = len(xs) // 2\n    left = merge_sort(xs[:mid])\n    right = merge_sort(xs[mid:])\n    \n    return merge(left, right)\n\ndef merge(left, right):\n    result = []\n    i = j = 0\n    while i < len(left) and j < len(right):\n        if left[i] <= right[j]:\n            result.append(left[i])\n            i += 1\n        else:\n            result.append(right[j])\n            j += 1\n    result.extend(left[i:])\n    result.extend(right[j:])\n    return result\n\ndef quicksort(xs):\n    \"\"\"\n    Sorts a list using the quicksort algorithm.\n    \n    Args:\n        xs (list): A list of comparable elements.\n        \n    Returns:\n        list: A new list containing the elements in ascending order.\n    \"\"\"\n    if len(xs) <= 1:\n        return xs\n    \n    pivot = xs[len(xs) // 2]\n    left = [x for x in xs if x < pivot]\n    middle = [x for x in xs if x == pivot]\n    right = [x for x in xs if x > pivot]\n    \n    return quicksort(left) + middle + quicksort(right)"
    },
    "verified": {
@@ -172,7 +172,7 @@
     "valid_block_rate": 0.5,
     "n_blocks": 2,
     "total_denoisings": 6,
-    "wall_s": 11.61,
+    "wall_s": 9.23,
     "code": "def merge_sort(xs):\n    \"\"\"\n    Sorts a list using the merge sort algorithm.\n    \n    Args:\n        xs (list): A list of comparable elements.\n        \n    Returns:\n        list: A new list containing the elements in ascending order.\n    \"\"\"\n    if len(xs) <= 1:\n        return xs\n    \n    mid = len(xs) // 2\n    left = merge_sort(xs[:mid])\n    right = merge_sort(xs[mid:])\n    \n    return merge(left, right)\n\ndef merge(left, right):\n    result = []\n    i = j = 0\n    while i < len(left) and j < len(right):\n        if left[i] <= right[j]:\n            result.append(left[i])\n            i += 1\n        else:\n            result.append(right[j])\n            j += 1\n    result.extend(left[i:])\n    result.extend(right[j:])\n    return result\n\ndef quicksort(xs):\n    \"\"\"\n    Sorts a list using the quicksort algorithm.\n    \n    Args:\n        xs (list): A list of comparable elements.\n        \n    Returns:\n        list: A new list containing the elements in ascending order.\n    \"\"\"\n    if len(xs) <= 1:\n        return xs\n    \n    pivot = xs[len(xs) // 2]\n    left = [x for x in xs if x < pivot]\n    middle = [x for x in xs if x == pivot]\n    right = [x for x in xs if x > pivot]\n    \n    return quicksort(left) + middle + quicksort(right)"
    }
   },
@@ -183,7 +183,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.46,
+    "wall_s": 1.15,
     "code": "import time\nfrom contextlib import contextmanager\n\nclass Timer:\n    def __enter__(self):\n        self.start_time = time.perf_counter()\n        return self\n\n    def __exit__(self, exc_type, exc_val, exc_tb):\n        end_time = time.perf_counter()\n        elapsed = (end_time - self.start_time) * 1000\n        print(f\"Elapsed time: {elapsed:.2f} ms\")\n\n@contextmanager\ndef timer_context():\n    start_time = time.perf_counter()\n    try:\n        yield\n    finally:\n        end_time = time.perf_counter()\n        elapsed = (end_time - start_time) * 1000\n        print(f\"Elapsed time: {elapsed:.2f} ms\")"
    },
    "verified": {
@@ -191,7 +191,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.45,
+    "wall_s": 1.15,
     "code": "import time\nfrom contextlib import contextmanager\n\nclass Timer:\n    def __enter__(self):\n        self.start_time = time.perf_counter()\n        return self\n\n    def __exit__(self, exc_type, exc_val, exc_tb):\n        end_time = time.perf_counter()\n        elapsed = (end_time - self.start_time) * 1000\n        print(f\"Elapsed time: {elapsed:.2f} ms\")\n\n@contextmanager\ndef timer_context():\n    start_time = time.perf_counter()\n    try:\n        yield\n    finally:\n        end_time = time.perf_counter()\n        elapsed = (end_time - start_time) * 1000\n        print(f\"Elapsed time: {elapsed:.2f} ms\")"
    }
   },
@@ -202,7 +202,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 2.56,
+    "wall_s": 2.02,
     "code": "from collections import defaultdict\n\ndef group_by(items, key):\n    result = defaultdict(list)\n    for item in items:\n        result[key(item)].append(item)\n    return dict(result)\n\n# Example using nested comprehension to process data\ndata = [\n    {'name': 'apple', 'type': 'fruit'},\n    {'name': 'carrot', 'type': 'vegetable'},\n    {'name': 'banana', 'type': 'fruit'},\n    {'name': 'broccoli', 'type': 'vegetable'}\n]\n\ngrouped = group_by(data, lambda x: x['type'])\n\n# Nested comprehension example to transform grouped data\noutput = {\n    k: [item['name'] for item in v] \n    for k, v in grouped.items()\n}\n\nprint(output)"
    },
    "verified": {
@@ -210,7 +210,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 2.56,
+    "wall_s": 2.02,
     "code": "from collections import defaultdict\n\ndef group_by(items, key):\n    result = defaultdict(list)\n    for item in items:\n        result[key(item)].append(item)\n    return dict(result)\n\n# Example using nested comprehension to process data\ndata = [\n    {'name': 'apple', 'type': 'fruit'},\n    {'name': 'carrot', 'type': 'vegetable'},\n    {'name': 'banana', 'type': 'fruit'},\n    {'name': 'broccoli', 'type': 'vegetable'}\n]\n\ngrouped = group_by(data, lambda x: x['type'])\n\n# Nested comprehension example to transform grouped data\noutput = {\n    k: [item['name'] for item in v] \n    for k, v in grouped.items()\n}\n\nprint(output)"
    }
   },
@@ -221,7 +221,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.22,
+    "wall_s": 0.95,
     "code": "class Trie:\n    def __init__(self):\n        self.root = {}\n\n    def insert(self, word: str):\n        node = self.root\n        for char in word:\n            if char not in node:\n                node[char] = {}\n            node = node[char]\n        node['#'] = True\n\n    def search(self, word: str) -> bool:\n        node = self.root\n        for char in word:\n            if char not in node:\n                return False\n            node = node[char]\n        return '#' in node\n\n    def starts_with(self, prefix: str) -> bool:\n        node = self.root\n        for char in prefix:\n            if char not in node:\n                return False\n            node = node[char]\n        return True"
    },
    "verified": {
@@ -229,7 +229,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.22,
+    "wall_s": 0.95,
     "code": "class Trie:\n    def __init__(self):\n        self.root = {}\n\n    def insert(self, word: str):\n        node = self.root\n        for char in word:\n            if char not in node:\n                node[char] = {}\n            node = node[char]\n        node['#'] = True\n\n    def search(self, word: str) -> bool:\n        node = self.root\n        for char in word:\n            if char not in node:\n                return False\n            node = node[char]\n        return '#' in node\n\n    def starts_with(self, prefix: str) -> bool:\n        node = self.root\n        for char in prefix:\n            if char not in node:\n                return False\n            node = node[char]\n        return True"
    }
   },
@@ -240,7 +240,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.86,
+    "wall_s": 1.47,
     "code": "import heapq\n\ndef dijkstra(graph: dict[str, dict[str, int]], start: str) -> dict[str, int]:\n    distances = {node: float('inf') for node in graph}\n    distances[start] = 0\n    queue = [(0, start)]\n\n    while queue:\n        current_distance, current_node = heapq.heappop(queue)\n\n        if current_distance > distances[current_node]:\n            continue\n\n        for neighbor, weight in graph[current_node].items():\n            distance = current_distance + weight\n            if distance < distances[neighbor]:\n                distances[neighbor] = distance\n                heapq.heappush(queue, (distance, neighbor))\n\n    return {node: int(dist) if dist != float('inf') else dist for node, dist in distances.items()}"
    },
    "verified": {
@@ -248,7 +248,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.87,
+    "wall_s": 1.47,
     "code": "import heapq\n\ndef dijkstra(graph: dict[str, dict[str, int]], start: str) -> dict[str, int]:\n    distances = {node: float('inf') for node in graph}\n    distances[start] = 0\n    queue = [(0, start)]\n\n    while queue:\n        current_distance, current_node = heapq.heappop(queue)\n\n        if current_distance > distances[current_node]:\n            continue\n\n        for neighbor, weight in graph[current_node].items():\n            distance = current_distance + weight\n            if distance < distances[neighbor]:\n                distances[neighbor] = distance\n                heapq.heappush(queue, (distance, neighbor))\n\n    return {node: int(dist) if dist != float('inf') else dist for node, dist in distances.items()}"
    }
   },
@@ -259,7 +259,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.64,
+    "wall_s": 1.29,
     "code": "def evaluate(node):\n    match node:\n        case int() | float():\n            return node\n        case ('+', left, right):\n            return evaluate(left) + evaluate(right)\n        case ('-', left, right):\n            return evaluate(left) - evaluate(right)\n        case ('*', left, right):\n            return evaluate(left) * evaluate(right)\n        case ('/', left, right):\n            return evaluate(left) / evaluate(right)\n        case _:\n            raise ValueError(f\"Invalid AST node: {node}\")"
    },
    "verified": {
@@ -267,7 +267,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.64,
+    "wall_s": 1.29,
     "code": "def evaluate(node):\n    match node:\n        case int() | float():\n            return node\n        case ('+', left, right):\n            return evaluate(left) + evaluate(right)\n        case ('-', left, right):\n            return evaluate(left) - evaluate(right)\n        case ('*', left, right):\n            return evaluate(left) * evaluate(right)\n        case ('/', left, right):\n            return evaluate(left) / evaluate(right)\n        case _:\n            raise ValueError(f\"Invalid AST node: {node}\")"
    }
   },
@@ -278,7 +278,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.02,
+    "wall_s": 0.79,
     "code": "from collections import defaultdict\n\nclass EventEmitter:\n    def __init__(self):\n        self.events = defaultdict(list)\n\n    def on(self, event, handler):\n        self.events[event].append(handler)\n\n    def off(self, event, handler):\n        if event in self.events:\n            try:\n                self.events[event].remove(handler)\n            except ValueError:\n                pass\n\n    def emit(self, event, *args, **kwargs):\n        if event in self.events:\n            for handler in self.events[event]:\n                handler(*args, **kwargs)"
    },
    "verified": {
@@ -286,7 +286,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.02,
+    "wall_s": 0.8,
     "code": "from collections import defaultdict\n\nclass EventEmitter:\n    def __init__(self):\n        self.events = defaultdict(list)\n\n    def on(self, event, handler):\n        self.events[event].append(handler)\n\n    def off(self, event, handler):\n        if event in self.events:\n            try:\n                self.events[event].remove(handler)\n            except ValueError:\n                pass\n\n    def emit(self, event, *args, **kwargs):\n        if event in self.events:\n            for handler in self.events[event]:\n                handler(*args, **kwargs)"
    }
   },
@@ -297,7 +297,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 3.29,
+    "wall_s": 2.59,
     "code": "import re\n\ndef parse_ini(text):\n    result = {}\n    current_section = None\n    for line in text.splitlines():\n        line = line.strip()\n        if not line or line.startswith(('#', ';')):\n            continue\n        if line.startswith('[') and line.endswith(']'):\n            current_section = line[1:-1]\n            result[current_section] = {}\n        elif '=' in line and current_section is not None:\n            key, value = line.split('=', 1)\n            result[current_section][key.strip()] = value.strip()\n    return result"
    },
    "verified": {
@@ -305,7 +305,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 3.29,
+    "wall_s": 2.58,
     "code": "import re\n\ndef parse_ini(text):\n    result = {}\n    current_section = None\n    for line in text.splitlines():\n        line = line.strip()\n        if not line or line.startswith(('#', ';')):\n            continue\n        if line.startswith('[') and line.endswith(']'):\n            current_section = line[1:-1]\n            result[current_section] = {}\n        elif '=' in line and current_section is not None:\n            key, value = line.split('=', 1)\n            result[current_section][key.strip()] = value.strip()\n    return result"
    }
   },
@@ -316,7 +316,7 @@
     "valid_block_rate": 0.5,
     "n_blocks": 2,
     "total_denoisings": 2,
-    "wall_s": 2.24,
+    "wall_s": 1.77,
     "code": "class Matrix:\n    def __init__(self, data):\n        self.data = data\n        self.rows = len(data)\n        self.cols = len(data[0]) if self.rows > 0 else 0\n\n    def __getitem__(self, key):\n        row, col = key\n        return self.data[row][col]\n\n    def transpose(self):\n        new_data = [[self.data[r][c] for r in range(self.rows)] for c in range(self.cols)]\n        return Matrix(new_data)\n\n    def __matmul__(self, other):\n        if self.cols != other.rows:\n            raise ValueError(\"Incompatible dimensions for multiplication\")\n        new_data = []\n        for i in range(self.rows):\n            row = []\n            for j in range(other.cols):\n                element = sum(self.data[i][k] * other.data[k][j] for k in range(self.cols))\n                row.append(element)\n            new_data.append(row)\n        return Matrix(new_data)"
    },
    "verified": {
@@ -324,7 +324,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 2,
     "total_denoisings": 4,
-    "wall_s": 6.54,
+    "wall_s": 5.13,
     "code": "class Matrix:\n    def __init__(self, data):\n        self.data = data\n        self.rows = len(data)\n        self.cols = len(data[0]) if self.rows > 0 else 0\n\n    def __getitem__(self, key):\n        row, col = key\n        return self.data[row][col]\n\n    def transpose(self):\n        new_data = [[self.data[r][c] for r in range(self.rows)] for c in range(self.cols)]\n        return Matrix(new_data)\n\n    def __matmul__(self, other):\n        if self.cols != other.rows:\n            raise ValueError(\"Incompatible dimensions\")\n        new_data = []\n        for i in range(self.rows):\n            new_row = []\n            for j in range(other.cols):\n                element = sum(self.data[i][k] * other.data[k][j] for k in range(self.cols))\n                new_row.append(element)\n            new_data.append(new_row)\n        return Matrix(new_data)\n\n    def __repr__(self):\n        return f\"Matrix({self.data})\""
    }
   },
@@ -335,7 +335,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.23,
+    "wall_s": 0.96,
     "code": "import functools\n\ndef memoize(func):\n    cache = {}\n    @functools.wraps(func)\n    def wrapper(*args):\n        if args not in cache:\n            cache[args] = func(*args)\n        return cache[args]\n    return wrapper\n\n@memoize\ndef fib(n):\n    if n < 2:\n        return n\n    return fib(n - 1) + fib(n - 2)"
    },
    "verified": {
@@ -343,7 +343,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.23,
+    "wall_s": 0.97,
     "code": "import functools\n\ndef memoize(func):\n    cache = {}\n    @functools.wraps(func)\n    def wrapper(*args):\n        if args not in cache:\n            cache[args] = func(*args)\n        return cache[args]\n    return wrapper\n\n@memoize\ndef fib(n):\n    if n < 2:\n        return n\n    return fib(n - 1) + fib(n - 2)"
    }
   },
@@ -354,7 +354,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 2.24,
+    "wall_s": 1.77,
     "code": "import re\n\ndef tokenize(source):\n    specification = [\n        ('ID', r'[a-zA-Z_][a-zA-Z0-9_]*'),\n        ('INT', r'\\d+'),\n        ('OP', r'[+\\-*/=<>!|&%]+'),\n        ('SKIP', r'\\s+'),\n    ]\n    regex = '|'.join(f'(?P<{name}>{pattern})' for name, pattern in specification)\n    tokens = []\n    for match in re.finditer(regex, source):\n        kind = match.lastgroup\n        value = match.group()\n        if kind != 'SKIP':\n            tokens.append((kind, value))\n    return tokens"
    },
    "verified": {
@@ -362,7 +362,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 2.25,
+    "wall_s": 1.77,
     "code": "import re\n\ndef tokenize(source):\n    specification = [\n        ('ID', r'[a-zA-Z_][a-zA-Z0-9_]*'),\n        ('INT', r'\\d+'),\n        ('OP', r'[+\\-*/=<>!|&%]+'),\n        ('SKIP', r'\\s+'),\n    ]\n    regex = '|'.join(f'(?P<{name}>{pattern})' for name, pattern in specification)\n    tokens = []\n    for match in re.finditer(regex, source):\n        kind = match.lastgroup\n        value = match.group()\n        if kind != 'SKIP':\n            tokens.append((kind, value))\n    return tokens"
    }
   },
@@ -373,7 +373,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 2.17,
+    "wall_s": 1.82,
     "code": "class StateMachine:\n    def __init__(self, transitions, initial_state):\n        self.transitions = transitions\n        self.state = initial_state\n\n    def fire(self, event):\n        if event not in self.transitions.get(self.state, {}):\n            raise ValueError(f\"Invalid event '{event}' for state '{self.state}'\")\n        \n        old_state = self.state\n        self.state = self.transitions[self.state][event]\n        print(f\"Transitioned from '{old_state}' to '{self.state}' via event '{event}'\")"
    },
    "verified": {
@@ -381,7 +381,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.74,
+    "wall_s": 1.81,
     "code": "class StateMachine:\n    def __init__(self, transitions, initial_state):\n        self.transitions = transitions\n        self.state = initial_state\n\n    def fire(self, event):\n        if event not in self.transitions.get(self.state, {}):\n            raise ValueError(f\"Invalid event '{event}' for state '{self.state}'\")\n        \n        old_state = self.state\n        self.state = self.transitions[self.state][event]\n        print(f\"Transitioned from '{old_state}' to '{self.state}' via event '{event}'\")"
    }
   },
@@ -392,7 +392,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.25,
+    "wall_s": 1.29,
     "code": "def topological_sort(deps: dict[str, list[str]]) -> list[str]:\n    in_degree = {u: 0 for u in deps}\n    for neighbors in deps.values():\n        for v in neighbors:\n            if v not in in_degree:\n                in_degree[v] = 0\n            in_degree[v] += 1\n\n    queue = [u for u in in_degree if in_degree[u] == 0]\n    sorted_list = []\n\n    while queue:\n        u = queue.pop(0)\n        sorted_list.append(u)\n        if u in deps:\n            for v in deps[u]:\n                in_degree[v] -= 1\n                if in_degree[v] == 0:\n                    queue.append(v)\n\n    if len(sorted_list) != len(in_degree):\n        raise ValueError(\"Cycle detected in the dependency graph\")\n\n    return sorted_list"
    },
    "verified": {
@@ -400,7 +400,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.25,
+    "wall_s": 1.3,
     "code": "def topological_sort(deps: dict[str, list[str]]) -> list[str]:\n    in_degree = {u: 0 for u in deps}\n    for neighbors in deps.values():\n        for v in neighbors:\n            if v not in in_degree:\n                in_degree[v] = 0\n            in_degree[v] += 1\n\n    queue = [u for u in in_degree if in_degree[u] == 0]\n    sorted_list = []\n\n    while queue:\n        u = queue.pop(0)\n        sorted_list.append(u)\n        if u in deps:\n            for v in deps[u]:\n                in_degree[v] -= 1\n                if in_degree[v] == 0:\n                    queue.append(v)\n\n    if len(sorted_list) != len(in_degree):\n        raise ValueError(\"Cycle detected in the dependency graph\")\n\n    return sorted_list"
    }
   },
@@ -411,7 +411,7 @@
     "valid_block_rate": 0.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 7.53,
+    "wall_s": 7.83,
     "code": "def pascals_triangle(n):\n    return [[1] + [row[i] + row[i+1] for i in range(len(row)-1)] + [1] if row else [1] for row in (lambda t: reduce(lambda x, y: x.append([1] + [y[i] + y[i+1] for i in range(len(y)-11 + [111111111111"
    },
    "verified": {
@@ -419,7 +419,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 2,
-    "wall_s": 14.23,
+    "wall_s": 14.87,
     "code": "def pascals_triangle(n):\n    return reduce(lambda acc, i: acc + [[acc[-1][j-1] if j > 0 else acc[-1][j] if j < len(acc[-1]) else 1 for j in range(i + 1)]], range(1, n), [[1]]) if n > 0 else []\n\nimport functools\nlambda m: [list(row) for row in zip(*m)]\n\nfrom functools import reduce"
    }
   },
@@ -430,7 +430,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.41,
+    "wall_s": 1.45,
     "code": "class RingBuffer:\n    def __init__(self, size):\n        self.size = size\n        self.buffer = [None] * size\n        self.count = 0\n        self.head = 0\n\n    def append(self, item):\n        self.buffer[self.head] = item\n        self.head = (self.head + 1) % self.size\n        if self.count < self.size:\n            self.count += 1\n\n    def __iter__(self):\n        start = self.head if self.count == self.size else 0\n        for i in range(self.count):\n            yield self.buffer[(start + i) % self.size]\n\n    def __len__(self):\n        return self.count"
    },
    "verified": {
@@ -438,7 +438,7 @@
     "valid_block_rate": 1.0,
     "n_blocks": 1,
     "total_denoisings": 1,
-    "wall_s": 1.41,
+    "wall_s": 1.46,
     "code": "class RingBuffer:\n    def __init__(self, size):\n        self.size = size\n        self.buffer = [None] * size\n        self.count = 0\n        self.head = 0\n\n    def append(self, item):\n        self.buffer[self.head] = item\n        self.head = (self.head + 1) % self.size\n        if self.count < self.size:\n            self.count += 1\n\n    def __iter__(self):\n        start = self.head if self.count == self.size else 0\n        for i in range(self.count):\n            yield self.buffer[(start + i) % self.size]\n\n    def __len__(self):\n        return self.count"
    }
   }