uber-polya copilot-instructions.md

uber-polya copilot-instructions.md is an instructions file for GitHub Copilot from agtm1199/uber-polya. It costs 437 tokens per session, scanned A, original, Apache-2.0.

Project instructions for a mathematical problem-solving engine based on George Pólya's method. It turns real-world problems into formal models, solves them with Python, checks the results, and explains their practical meaning.

In plain words
What is it for?
They are for classifying problems, building mathematical models, choosing algorithms, writing verified Python solvers, testing sensitivity, and translating results into actions.
Why use it?
They provide a repeatable structure for moving from a vague problem to a tested mathematical answer and useful recommendations.

Instructions file for GitHub Copilot

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 instructions/agtm1199/uber-polya/copilot-instructions
Clone the repo
git clone --depth 1 https://github.com/agtm1199/uber-polya

Made for: GitHub Copilot.

Wrote this? Show the measurements

A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.

agentmods badge for uber-polya copilot-instructions.md

README.md
[![agentmods](https://agentmods.dev/badge/instructions/agtm1199/uber-polya/copilot-instructions.svg)](https://agentmods.dev/instructions/agtm1199/uber-polya/copilot-instructions)
Your own site
<a href="https://agentmods.dev/instructions/agtm1199/uber-polya/copilot-instructions"><img src="https://agentmods.dev/badge/instructions/agtm1199/uber-polya/copilot-instructions.svg" alt="Measured on agentmods" height="20"></a>
Per session 437 This file is loaded in full into every session.
When invoked 437 The same file — it is already loaded in full.
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.00437 $0.00437
Opus 5 $0.00218 $0.00218
Sonnet 5 $0.00087 $0.00087
Haiku 4.5 $0.00044 $0.00044

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

Security

Grade A, and why

uber-polya copilot-instructions.md 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 3d 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.

.github/copilot-instructions.md · 35 lines

What it actually says

uber-polya

This project is a mathematical problem-solving engine implementing George Polya's "How to Solve It" methodology. It solves real-world problems through a three-phase pipeline: Model (formalize the problem), Solve (implement and verify), Interpret (translate to actionable insight).

When a User Presents a Problem

Follow the full protocol in docs/methodology.md and AGENTS.md.

Pipeline Summary

  1. Phase A -- Model: Classify the problem (Find vs. Prove). Consult skills/uber-model/references/ for pattern matching against 91 mathematical structures. Build a formal model with a real-world-to-math mapping table.
  2. Phase B -- Solve: Select an algorithm from the 305 cataloged in skills/uber-solve/references/. Implement a Python solver with Instance/Solution dataclasses, solve(), and verify() functions. Verify independently.
  3. Phase C -- Interpret: Consult skills/uber-interpret/references/. Reverse the mapping. Run sensitivity analysis. Generate visualizations. Provide actionable recommendations.

Key Convention

Ask the user to confirm at each phase gate before proceeding to the next phase.

Python Code

Solvers use Python 3.10+, dataclass(frozen=True) for Instance, separate verify() function, time.perf_counter() for timing, type hints on all signatures. See docs/methodology.md for the full template.

Output Format

The pipeline supports three output formats (ask the user before starting):

  • Python (default): solver script + console output + JSON
  • LaTeX/PDF: professional mathematical report (.tex + .pdf), no code shown
  • Both: full Python output AND compiled PDF report

PDF generation uses fpdf2 + matplotlib (no system LaTeX needed). See utils/latex_renderer.py and templates/latex/.

Worked Examples

See examples/ for 36 fully worked problems with runnable solver scripts.

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. 3d ago First seen · 35 lines · 437 tokens per session scan A ea6116d1a99d

Subscribe to this mod's changes

uber-polya copilot-instructions.md is an instructions file published in the GitHub repository agtm1199/uber-polya (4 stars, last pushed 6mo ago), licensed Apache-2.0. It adds 437 tokens to every session, about $0.0022 per session on Opus 5. 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.