blitzkode / docs /evaluation_results.json
neuralbroker's picture
Update clean backend-only project docs and eval
f9b1e65 verified
{
"model_path": "C:\\Dev\\Projects\\BlitzKode\\blitzkode.gguf",
"load_seconds": 0.312,
"settings": {
"ctx": 2048,
"threads": 8,
"batch": 256,
"gpu_layers": 0
},
"summary": {
"passed": 3,
"total": 4,
"pass_rate": 0.75,
"total_generation_seconds": 28.864
},
"results": [
{
"name": "python_factorial",
"passed": true,
"checks_passed": 2,
"checks_total": 2,
"latency_seconds": 5.448,
"prompt": "Write a Python function named factorial that handles 0, positive integers, and rejects negative input.",
"response": "```python\ndef factorial(n):\n if n < 0:\n raise ValueError('Input must be non-negative')\n result = 1\n for i in range(2, n+1):\n result *= i\n return result\n```\nTime O(n), Space O(1)"
},
{
"name": "binary_search",
"passed": true,
"checks_passed": 3,
"checks_total": 3,
"latency_seconds": 17.673,
"prompt": "Implement iterative binary search in Python. Return the index or -1.",
"response": "```python\ndef binary_search(arr, target):\n l, r = 0, len(arr)-1\n while l <= r:\n mid = (l + r) // 2\n if arr[mid] == target: return mid\n elif arr[mid] < target: l = mid + 1\n else: r = mid - 1\n return -1\n```\nTime O(log n), Space O(1)"
},
{
"name": "sql_top_users",
"passed": true,
"checks_passed": 2,
"checks_total": 2,
"latency_seconds": 3.777,
"prompt": "Write SQL to return the top 5 users by order count from users and orders tables.",
"response": "```sql\nSELECT u.name, COUNT(o.id) as order_count\nFROM users u\nJOIN orders o ON u.id = o.user_id\nGROUP BY u.id\nORDER BY order_count DESC\nLIMIT 5;\n```"
},
{
"name": "unknown_api_uncertainty",
"passed": false,
"checks_passed": 0,
"checks_total": 1,
"latency_seconds": 1.966,
"prompt": "What is the exact signature of imaginary_blitz_api()? If you are not sure, say you do not know.",
"response": "```python\ndef imaginary_blitz_api(param1, param2):\n # API logic here\n return result\n```\nExact signature depends on API definition"
}
]
}