Coding-Hard-Consistent-Hash

The model receives the prompt (and optional system message). The run uses scorer javascript_function_tests with the JSON configuration below. Pass/fail and partial credit are determined entirely by that scorer against the model output; no human grading.

Return JSON only with a string field named code. The code must be dependency-free JavaScript, define the requested function in the top level or module.exports, and include no markdown, imports, require, timers, network, filesystem, eval, or placeholders.

Implement function consistentHash(nodes, key, virtualNodes). Distribute keys across nodes using a consistent hash ring of size 360. Place virtualNodes virtual points per node using: position = charCodeSum(nodeName) * (virtualIndex + 1) % 360, where charCodeSum sums all char codes of the string. Hash the key using keyPos = charCodeSum(key) % 360. Walk the ring clockwise to find the nearest virtual point at or after keyPos; wrap around to the lowest-position point if needed. When multiple virtual points share the same position, pick the one belonging to the lexicographically smallest node name. Return the node name.

Your JSON must look like {"code":"function consistentHash(...) { ... }"}.

{
  "function_name": "consistentHash",
  "timeout_ms": 100,
  "test_pass_threshold": 1,
  "partial_credit_threshold": 0.5,
  "tests": "[hidden executable tests]"
}