{"id": "test-1", "title": "Test round (not a real competition)", "family": "factor", "commitments": ["1f520500503e27c82413a672789a301dc40296b1d700275579ce988ef4bef8bd", "4aa6e0553f1d2b3a72a07b8ea410ba0667558405431a8732ca9eeb0754ef0f59", "d3387c9a98f8a2846e6c49876397252c6e559b72b7628f69f3e38df47901f907"], "opens_at": 1795276894.9668086, "closes_at": 1795363294, "state": "revealed", "n": 2, "budget": 5.0, "max_submissions": 50, "allow_private": false, "cost_model": "count", "count": {"cap": 5.0, "counter_sha256": "e5d6b668af9989599d2825ed01dfd63353af8099d471e51aa00e1dbd9dead315", "dims": [24, 26], "n": 2, "python": "cpython 3.14.4", "steps_per_second": 1000000}, "fingerprint": {"baseline": "solvers/factor_trial_py.py", "baseline_sha256": "8d429f3eb2651cd3eac1addd50b7a52bc9b755e457fe50af96d4d8e6063136d7", "code": {"count_runner.py": "e5d6b668af9989599d2825ed01dfd63353af8099d471e51aa00e1dbd9dead315", "counted.py": "ba2bde9f7895202c32840b35ac6542020e7d47b63dd9223f44ab70e99c719454", "declared.py": "cf27909aa0b3436345919c4e2918e6760ed1b182aac145a90e3de5dafda36cef", "extrapolate.py": "3184799efdf9133d53d476ae7fddd3f9e46988f9a58f2192c5b773023d3e672f", "families.py": "06da3bcb599e76f29bcda66ad35bb6d431e7a63c21b3fdcdb36e209a026a9c51", "harness.py": "cad8633c0ba3b1055b8c6a9ff8e99c5b990d9076182f9fcb61cdc70bbb48c67c", "instances.py": "ea2a61628f280fa37262b86a9f61fbfebec8164fab43ac6a4f4edc3876929067", "instances_factor.py": "75c56f34b632dd39b1527a8df97db952e0676de3cfcccf2b3cc94449a8c1f2b1", "instances_mlwe.py": "b16ffaa6ff1aa92b7dd212ad8ae250b17a7efed5e3765995b5a89e454cbf4c12", "judge.py": "66a1dd62bce6fcacf5eb52d743de103f386173fe7a9e9f6d0beca4fa74c85053", "official.py": "32b0de6abe160fa7114fab7e7db653792f74e4c4afe6a000b4f461dab65334c6", "runner.py": "6b1a319d7ce289be40b8ec4a159863d9e7835291eb4934c9062ab6ea29190246", "sandbox/Dockerfile.v2": "f25cdfb765207dbfd7161c55c9220f62956ac8c3e4110f6df413ddd020a91fe0", "sandbox/meter.py": "26b89a5476f16dd48f5f6fcd2ede75536f935dc32b99f942b8328357323fb0ab", "sandbox/meter_core.py": "8d58ec151f7e79a13bb471b31abf640f8c51ca07f3a757e4f75e876909dbb51e"}, "cost_model": "count", "dims": [24, 26], "instance_version": "factor-v1"}, "consistency_problems": [], "log_ok": true, "log_entries": 6, "log_head": "2be96b5e043f809a9400dc8320c436ca93e11db62e04d62ed3879b4534a3296e", "log_error": "", "submissions": [{"id": "24c5c703c011", "handle": "alice-test", "sha256": "8d429f3eb2651cd3eac1addd50b7a52bc9b755e457fe50af96d4d8e6063136d7", "submitted_at": 1795276908.067513, "seq": 1, "log_hash": "b5e28e7109c15d1f6d05003de6a3e0d3a5800dfe449fa15e57b79a0251a179cb", "state": "done", "warnings": [], "result": {"credit": 0.0, "per_seed": ["inconclusive", "inconclusive", "inconclusive"], "reasons": [], "status": "COUNTED"}, "reason": "", "certificate": {"path": "/api/cert/test-1/24c5c703c011.json", "private": false}, "source": "\"\"\"Factoring baseline: plain trial division over odd candidates in a Python loop. Deterministic; cost ~ the smaller factor.\"\"\"\n\n\ndef solve(n):\n    if n % 2 == 0:\n        return 2\n    d = 3\n    while d * d <= n:\n        if n % d == 0:\n            return d\n        d += 2\n    return n  # n is prime: no nontrivial divisor (the verifier rejects this, which is correct)\n"}], "seeds": {"1f520500503e27c82413a672789a301dc40296b1d700275579ce988ef4bef8bd": "c9403adc71f96e00efb5c7bbc37f53ec6e159911e2d240546baf73e6f193b69d", "4aa6e0553f1d2b3a72a07b8ea410ba0667558405431a8732ca9eeb0754ef0f59": "7504fc01a600b3a2f3f4a94059c6f55fca2a824662aa455c104d410a50fa5290", "d3387c9a98f8a2846e6c49876397252c6e559b72b7628f69f3e38df47901f907": "c7f16bdef66fb6ad1e4a791c266db3e854952aa7181e3c45c862de79fd02429d"}}