eschaton_complexity_profile
Profiles C/C++ algorithms by counting guest instructions with Valgrind Lackey to determine runtime growth and prove O(N) versus O(N²) complexity without CPU jitter.
Instructions
Deterministic cycle and instruction counter via Valgrind Lackey: measures exact guest instruction counts to mathematically prove O(N) vs O(N^2) complexity immune to CPU jitter.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"source_code": "<source_code>"
},
"name": "eschaton_complexity_profile"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| stdin | No | Standard input for algorithm | 100 |
| language_id | No | C or C++ language ID (e.g. 50, 54, 201, 202) | |
| source_code | Yes | C/C++ algorithm source code to profile |