Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx agentmods add rules/agtm1199/uber-polya/solver-conventionsgit clone --depth 1 https://github.com/agtm1199/uber-polyaWhat it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5 | $0.00000 | $0.00341 |
| Opus 5 | $0.00000 | $0.00170 |
| Sonnet 5 | $0.00000 | $0.00068 |
| Haiku 4.5 | $0.00000 | $0.00034 |
Grade A, and why
solver-conventions scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
What it actually says
Solver Conventions
Python 3.10+ solvers must follow these standards:
Required Structure
#!/usr/bin/env python3
"""[Problem name] solver. O([complexity]). [Correctness guarantee]."""
from __future__ import annotations
import time
from dataclasses import dataclass
@dataclass(frozen=True)
class Instance:
"""Immutable problem instance."""
...
@dataclass
class Solution:
"""Solution with metadata."""
value: ...
objective: float | None
is_optimal: bool
is_feasible: bool
algorithm: str
time_seconds: float
certificate: str | None
def solve(instance: Instance) -> Solution:
t0 = time.perf_counter()
# ... algorithm ...
elapsed = time.perf_counter() - t0
return Solution(...)
def verify(instance: Instance, solution) -> bool:
"""Independent verification. Must NOT share logic with solve()."""
...
Rules
- Type hints on all function signatures
from __future__ import annotationsat top@dataclass(frozen=True)for Instance,@dataclassfor Solutiontime.perf_counter()for timing (nottime.time())solve()andverify()must be separate with no shared logic- Deterministic output (seed RNG if randomized)
- Handle edge cases: n=0, n=1, disconnected, infeasible, unbounded
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 2d ago First seen · 55 lines · 0 tokens per session scan A fd407391d2d9
solver-conventions is a cursor rule published in the GitHub repository agtm1199/uber-polya (4 stars, last pushed 6mo ago), licensed Apache-2.0. It costs nothing until one of its globs matches a file; then it loads 341 tokens. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.
Other cursor rules, from other repositories
docs-ops-demo
Agent rules for docs-ops-demo.
angular-20
This rule provides comprehensive best practices and coding standards for Angular development, focusing on modern TypeScript, standalone components, signals, and performance optimizations.
dev-standard
Apache Superset development standards and guidelines for Cursor IDE.
cli-error-handling
CLI command error handling patterns.
prefer-direct-imports-over-module-mocks
Prefer extracting a testable core over vi.mock / vi.resetModules when unit tests need to reach production logic entangled with config, env, or singletons.
control-plane-descriptors
Control plane descriptor and instance implementation patterns.