solver-conventions

Python coding rules for writing optimization and problem-solving programs in the Uber-Polya project. They define the structure, types, timing, results, and independent checks each solver should use.

In plain words
What is it for?
Use them when creating or reviewing Python 3.10+ solvers, especially programs that report whether a solution is valid or optimal, how long it took, and how it was produced.
Why use it?
They keep generated solvers consistent and make their results easier to inspect and verify. Separate solving and checking code helps catch mistakes.

Cursor rule for Cursor

Install

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.

agentmods
npx agentmods add rules/agtm1199/uber-polya/solver-conventions
Clone the repo
git clone --depth 1 https://github.com/agtm1199/uber-polya

Made for: Cursor.

Per session 0 Nothing until a file matches its globs; then the whole rule loads.
When invoked 341 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

What 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.

ModelPer sessionOnce 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

Measured 2d ago against content hash fd407391d2d9, method: parsed. Prices are Anthropic first-party input rates as of 2026-08-30, from the pricing page.

Security

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.

.cursor/rules/solver-conventions.mdc · 55 lines

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 annotations at top
  • @dataclass(frozen=True) for Instance, @dataclass for Solution
  • time.perf_counter() for timing (not time.time())
  • solve() and verify() must be separate with no shared logic
  • Deterministic output (seed RNG if randomized)
  • Handle edge cases: n=0, n=1, disconnected, infeasible, unbounded
Changes

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.

  1. 2d ago First seen · 55 lines · 0 tokens per session scan A fd407391d2d9

Subscribe to this mod's changes

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.