foxmath 0.3.0__tar.gz → 0.5.0__tar.gz

{foxmath-0.3.0/src/foxmath.egg-info → foxmath-0.5.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: foxmath
-Version: 0.3.0
+Version: 0.5.0
 Summary: Minimalist CLI for math & cryptography exploration 🦊
 Author-email: Abhrankan Chakrabarti <abhrankan@gmail.com>
 License: MIT
@@ -28,12 +28,15 @@ Built with curiosity — for students, tinkerers, and crypto/math enthusiasts.
 ## Features
 - Legendre symbol
 - Euler/Hermann Machin-like π approximation
-- Elliptic curve point addition (over finite fields)
+- Elliptic curve point addition (over finite fields), including
+  named curves (secp256k1) with on-curve result validation
 - Chinese Remainder Theorem solver (handles non-coprime moduli)
 - Continued fraction expansion and convergents
-- Symlink-friendly (foxmath-legendre, foxmath-pi, foxmath-ecadd, foxmath-crt, foxmath-cf)
+- Challenge/quiz mode — practice problems with scoring, or a
+  worksheet mode for self-study
+- Symlink-friendly (foxmath-legendre, foxmath-pi, foxmath-ecadd,
+  foxmath-crt, foxmath-cf, foxmath-challenge)
 - JSON output mode
-- Coming soon: challenge mode, more curves
 
 ## Installation
 
@@ -72,6 +75,15 @@ foxmath-ecadd --x1 1 --y1 2 --x2 3 --y2 4 --p 17
 Result point: (14, 2)
 ```
 
+```bash
+# Named curve (secp256k1) — computes 2G by default
+foxmath ecadd --curve secp256k1
+```
+```
+Result point: (89565891926547004231252920425935692360644145829622209833684329913297188986597, 12158399299693830322967808612713398636155367887041628176798871954788371653930)
+  ✓ on curve
+```
+
 ```bash
 # Chinese Remainder Theorem
 foxmath crt --r 2 3 2 --m 3 5 7
@@ -91,6 +103,20 @@ foxmath cf --num 355 --den 113
   355/113
 ```
 
+```bash
+# Challenge/quiz mode — worksheet (no prompting)
+foxmath challenge --topic legendre --count 2 --seed 1 --reveal
+```
+```
+1. Legendre symbol (10/13)
+   Answer: 1
+2. Legendre symbol (3/7)
+   Answer: -1
+```
+
+Drop `--reveal` to answer interactively instead, with scoring at the end.
+`--topic` accepts `legendre`, `crt`, or `mixed` (default).
+
 ```bash
 # JSON output
 foxmath pi --terms 100 --json

{foxmath-0.3.0 → foxmath-0.5.0}/README.md

@@ -9,12 +9,15 @@ Built with curiosity — for students, tinkerers, and crypto/math enthusiasts.
 ## Features
 - Legendre symbol
 - Euler/Hermann Machin-like π approximation
-- Elliptic curve point addition (over finite fields)
+- Elliptic curve point addition (over finite fields), including
+  named curves (secp256k1) with on-curve result validation
 - Chinese Remainder Theorem solver (handles non-coprime moduli)
 - Continued fraction expansion and convergents
-- Symlink-friendly (foxmath-legendre, foxmath-pi, foxmath-ecadd, foxmath-crt, foxmath-cf)
+- Challenge/quiz mode — practice problems with scoring, or a
+  worksheet mode for self-study
+- Symlink-friendly (foxmath-legendre, foxmath-pi, foxmath-ecadd,
+  foxmath-crt, foxmath-cf, foxmath-challenge)
 - JSON output mode
-- Coming soon: challenge mode, more curves
 
 ## Installation
 
@@ -53,6 +56,15 @@ foxmath-ecadd --x1 1 --y1 2 --x2 3 --y2 4 --p 17
 Result point: (14, 2)
 ```
 
+```bash
+# Named curve (secp256k1) — computes 2G by default
+foxmath ecadd --curve secp256k1
+```
+```
+Result point: (89565891926547004231252920425935692360644145829622209833684329913297188986597, 12158399299693830322967808612713398636155367887041628176798871954788371653930)
+  ✓ on curve
+```
+
 ```bash
 # Chinese Remainder Theorem
 foxmath crt --r 2 3 2 --m 3 5 7
@@ -72,6 +84,20 @@ foxmath cf --num 355 --den 113
   355/113
 ```
 
+```bash
+# Challenge/quiz mode — worksheet (no prompting)
+foxmath challenge --topic legendre --count 2 --seed 1 --reveal
+```
+```
+1. Legendre symbol (10/13)
+   Answer: 1
+2. Legendre symbol (3/7)
+   Answer: -1
+```
+
+Drop `--reveal` to answer interactively instead, with scoring at the end.
+`--topic` accepts `legendre`, `crt`, or `mixed` (default).
+
 ```bash
 # JSON output
 foxmath pi --terms 100 --json

{foxmath-0.3.0 → foxmath-0.5.0}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "foxmath"
-version = "0.3.0"
+version = "0.5.0"
 description = "Minimalist CLI for math & cryptography exploration 🦊"
 readme = "README.md"
 license = {text = "MIT"}
@@ -33,3 +33,4 @@ foxmath-pi = "foxmath.foxmath:main"
 foxmath-ecadd = "foxmath.foxmath:main"
 foxmath-crt = "foxmath.foxmath:main"
 foxmath-cf = "foxmath.foxmath:main"
+foxmath-challenge = "foxmath.foxmath:main"

{foxmath-0.3.0 → foxmath-0.5.0}/src/foxmath/foxmath.py

@@ -7,7 +7,9 @@ One binary. Clean. Educational. Safe.
 import argparse
 import sys
 import json
+import random
 from decimal import Decimal, getcontext
+from math import gcd
 from pathlib import Path
 
 # ------------------- Math Functions -------------------
@@ -54,6 +56,28 @@ def ec_point_add(x1, y1, x2, y2, a, p):
     y3 = (lam * (x1 - x3) - y1) % p
     return x3, y3
 
+# Named curve presets: a, b, p, and the standard generator point G (if defined).
+CURVES = {
+    "secp256k1": {
+        "a": 0,
+        "b": 7,
+        "p": 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F,
+        "gx": 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798,
+        "gy": 0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8,
+    },
+    "toy97": {  # small curve for quick hand-checkable examples: y^2 = x^3 + 2x + 3 (mod 97)
+        "a": 2,
+        "b": 3,
+        "p": 97,
+        "gx": 3,
+        "gy": 6,
+    },
+}
+
+def is_on_curve(x: int, y: int, a: int, b: int, p: int) -> bool:
+    """Check y^2 = x^3 + a*x + b (mod p)."""
+    return (y * y - (x ** 3 + a * x + b)) % p == 0
+
 def _extended_gcd(a: int, b: int):
     """Returns (g, x, y) such that a*x + b*y == g == gcd(a, b)."""
     old_r, r = a, b
@@ -128,6 +152,46 @@ def cf_convergents(cf):
         k2, k1 = k1, k
     return convergents
 
+# ------------------- Challenge / Quiz Mode -------------------
+
+_SMALL_ODD_PRIMES = [3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,
+                      53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
+_CRT_MODULI_CANDIDATES = [3, 4, 5, 7, 9, 11, 13]
+
+def _generate_legendre_problem(rng: random.Random) -> dict:
+    p = rng.choice(_SMALL_ODD_PRIMES)
+    a = rng.randint(1, p - 1)
+    return {
+        "topic": "legendre",
+        "question": f"Legendre symbol ({a}/{p})",
+        "answer": legendre_symbol(a, p),
+    }
+
+def _generate_crt_problem(rng: random.Random) -> dict:
+    while True:
+        m1, m2 = rng.sample(_CRT_MODULI_CANDIDATES, 2)
+        if gcd(m1, m2) == 1:
+            break
+    r1, r2 = rng.randrange(m1), rng.randrange(m2)
+    x, m = crt_solve([r1, r2], [m1, m2])
+    return {
+        "topic": "crt",
+        "question": f"x ≡ {r1} (mod {m1}), x ≡ {r2} (mod {m2}); find x (0 ≤ x < {m})",
+        "answer": x,
+    }
+
+_TOPIC_GENERATORS = {
+    "legendre": _generate_legendre_problem,
+    "crt": _generate_crt_problem,
+}
+
+def generate_problem(topic: str, rng: random.Random) -> dict:
+    if topic == "mixed":
+        topic = rng.choice(list(_TOPIC_GENERATORS.keys()))
+    if topic not in _TOPIC_GENERATORS:
+        raise ValueError(f"Unknown challenge topic: {topic}")
+    return _TOPIC_GENERATORS[topic](rng)
+
 # ------------------- CLI -------------------
 
 def get_command():
@@ -171,12 +235,14 @@ def main():
 
     # Elliptic curve add
     ec = subparsers.add_parser("ecadd", help="Elliptic curve point addition")
-    ec.add_argument("--x1", type=int, required=True)
-    ec.add_argument("--y1", type=int, required=True)
-    ec.add_argument("--x2", type=int, required=True)
-    ec.add_argument("--y2", type=int, required=True)
-    ec.add_argument("--a", type=int, default=-3, help="Curve parameter a")
-    ec.add_argument("--p", type=int, required=True, help="Prime modulus")
+    ec.add_argument("--curve", choices=sorted(CURVES.keys()),
+                     help="Named curve (provides a, b, p, and generator G)")
+    ec.add_argument("--x1", type=int, help="Defaults to G's x if --curve is given")
+    ec.add_argument("--y1", type=int, help="Defaults to G's y if --curve is given")
+    ec.add_argument("--x2", type=int, help="Defaults to (x1,y1) if omitted (i.e. doubling)")
+    ec.add_argument("--y2", type=int, help="Defaults to (x1,y1) if omitted (i.e. doubling)")
+    ec.add_argument("--a", type=int, help="Curve parameter a (overrides --curve if given)")
+    ec.add_argument("--p", type=int, help="Prime modulus (overrides --curve if given)")
 
     # Chinese Remainder Theorem
     crt = subparsers.add_parser("crt", help="Solve a system of congruences x = r (mod m)")
@@ -189,6 +255,14 @@ def main():
     cf_cmd.add_argument("--den", type=int, required=True, help="Denominator")
     cf_cmd.add_argument("--terms", type=int, default=100, help="Max terms to expand")
 
+    # Challenge / quiz mode
+    challenge = subparsers.add_parser("challenge", help="Practice problems (Legendre, CRT)")
+    challenge.add_argument("--topic", choices=["legendre", "crt", "mixed"], default="mixed")
+    challenge.add_argument("--count", type=int, default=5, help="Number of problems")
+    challenge.add_argument("--seed", type=int, help="Random seed for reproducible problem sets")
+    challenge.add_argument("--reveal", action="store_true",
+                            help="Print problems with answers, no prompting (worksheet mode)")
+
     args = parser.parse_args(argv)
 
     result = {"tool": "foxmath"}
@@ -207,10 +281,41 @@ def main():
                 print(f"π ≈ {approx}  ({args.terms} terms)")
 
         elif cmd == "ecadd" or args.command == "ecadd":
-            x3, y3 = ec_point_add(args.x1, args.y1, args.x2, args.y2, args.a, args.p)
-            result.update({"command": "ecadd", "result": (x3, y3)})
+            a, b = args.a, None
+            p = args.p
+            x1, y1 = args.x1, args.y1
+
+            if args.curve:
+                preset = CURVES[args.curve]
+                a = preset["a"] if a is None else a
+                p = preset["p"] if p is None else p
+                b = preset["b"]
+                if x1 is None:
+                    x1, y1 = preset["gx"], preset["gy"]
+            elif a is None:
+                a = -3  # historical default for manual (non-curve) mode
+
+            if a is None or p is None or x1 is None or y1 is None:
+                raise ValueError(
+                    "Provide --curve NAME, or at least --p --x1 --y1 manually "
+                    "(--a defaults to -3 if omitted)."
+                )
+
+            x2 = x1 if args.x2 is None else args.x2
+            y2 = y1 if args.y2 is None else args.y2
+
+            x3, y3 = ec_point_add(x1, y1, x2, y2, a, p)
+            result.update({
+                "command": "ecadd", "curve": args.curve,
+                "p1": [x1, y1], "p2": [x2, y2], "result": (x3, y3),
+            })
+            if b is not None:
+                result["result_on_curve"] = is_on_curve(x3, y3, a, b, p)
             if not json_output:
                 print(f"Result point: ({x3}, {y3})")
+                if b is not None:
+                    status = "✓ on curve" if result["result_on_curve"] else "✗ NOT on curve"
+                    print(f"  {status}")
 
         elif cmd == "crt" or args.command == "crt":
             x, m = crt_solve(args.r, args.m)
@@ -230,6 +335,48 @@ def main():
                 for p, q in convs:
                     print(f"  {p}/{q}")
 
+        elif cmd == "challenge" or args.command == "challenge":
+            if args.count < 1:
+                raise ValueError(f"--count must be >= 1 (got {args.count})")
+
+            rng = random.Random(args.seed)
+            problems = [generate_problem(args.topic, rng) for _ in range(args.count)]
+
+            if args.reveal:
+                result.update({"command": "challenge", "topic": args.topic, "problems": problems})
+                if not json_output:
+                    for i, prob in enumerate(problems, 1):
+                        print(f"{i}. {prob['question']}")
+                        print(f"   Answer: {prob['answer']}")
+            else:
+                score = 0
+                details = []
+                for i, prob in enumerate(problems, 1):
+                    if not json_output:
+                        print(f"{i}. {prob['question']}")
+                    try:
+                        raw = input("   Your answer: ")
+                    except EOFError:
+                        raw = ""
+                    try:
+                        user_answer = int(raw.strip())
+                    except ValueError:
+                        user_answer = None
+                    correct = user_answer == prob["answer"]
+                    score += correct
+                    details.append({**prob, "your_answer": user_answer, "correct": correct})
+                    if not json_output:
+                        if correct:
+                            print("   ✓ Correct!")
+                        else:
+                            print(f"   ✗ Incorrect (answer: {prob['answer']})")
+                result.update({
+                    "command": "challenge", "topic": args.topic,
+                    "score": score, "total": args.count, "details": details,
+                })
+                if not json_output:
+                    print(f"\nScore: {score}/{args.count}")
+
     except Exception as e:
         print(f"Error: {e}", file=sys.stderr)
         sys.exit(1)

{foxmath-0.3.0 → foxmath-0.5.0/src/foxmath.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: foxmath
-Version: 0.3.0
+Version: 0.5.0
 Summary: Minimalist CLI for math & cryptography exploration 🦊
 Author-email: Abhrankan Chakrabarti <abhrankan@gmail.com>
 License: MIT
@@ -28,12 +28,15 @@ Built with curiosity — for students, tinkerers, and crypto/math enthusiasts.
 ## Features
 - Legendre symbol
 - Euler/Hermann Machin-like π approximation
-- Elliptic curve point addition (over finite fields)
+- Elliptic curve point addition (over finite fields), including
+  named curves (secp256k1) with on-curve result validation
 - Chinese Remainder Theorem solver (handles non-coprime moduli)
 - Continued fraction expansion and convergents
-- Symlink-friendly (foxmath-legendre, foxmath-pi, foxmath-ecadd, foxmath-crt, foxmath-cf)
+- Challenge/quiz mode — practice problems with scoring, or a
+  worksheet mode for self-study
+- Symlink-friendly (foxmath-legendre, foxmath-pi, foxmath-ecadd,
+  foxmath-crt, foxmath-cf, foxmath-challenge)
 - JSON output mode
-- Coming soon: challenge mode, more curves
 
 ## Installation
 
@@ -72,6 +75,15 @@ foxmath-ecadd --x1 1 --y1 2 --x2 3 --y2 4 --p 17
 Result point: (14, 2)
 ```
 
+```bash
+# Named curve (secp256k1) — computes 2G by default
+foxmath ecadd --curve secp256k1
+```
+```
+Result point: (89565891926547004231252920425935692360644145829622209833684329913297188986597, 12158399299693830322967808612713398636155367887041628176798871954788371653930)
+  ✓ on curve
+```
+
 ```bash
 # Chinese Remainder Theorem
 foxmath crt --r 2 3 2 --m 3 5 7
@@ -91,6 +103,20 @@ foxmath cf --num 355 --den 113
   355/113
 ```
 
+```bash
+# Challenge/quiz mode — worksheet (no prompting)
+foxmath challenge --topic legendre --count 2 --seed 1 --reveal
+```
+```
+1. Legendre symbol (10/13)
+   Answer: 1
+2. Legendre symbol (3/7)
+   Answer: -1
+```
+
+Drop `--reveal` to answer interactively instead, with scoring at the end.
+`--topic` accepts `legendre`, `crt`, or `mixed` (default).
+
 ```bash
 # JSON output
 foxmath pi --terms 100 --json

{foxmath-0.3.0 → foxmath-0.5.0}/src/foxmath.egg-info/entry_points.txt

@@ -1,6 +1,7 @@
 [console_scripts]
 foxmath = foxmath.foxmath:main
 foxmath-cf = foxmath.foxmath:main
+foxmath-challenge = foxmath.foxmath:main
 foxmath-crt = foxmath.foxmath:main
 foxmath-ecadd = foxmath.foxmath:main
 foxmath-legendre = foxmath.foxmath:main

{foxmath-0.3.0 → foxmath-0.5.0}/tests/test_cli.py

@@ -13,10 +13,10 @@ ROOT = os.path.abspath(os.path.join(os.path.dirname(__file__), "..", "src", "fox
 SCRIPT = os.path.join(ROOT, "foxmath.py")
 
 
-def run(*args, script=SCRIPT):
+def run(*args, script=SCRIPT, stdin_input=None):
     result = subprocess.run(
         [sys.executable, script, *args],
-        capture_output=True, text=True, timeout=15,
+        capture_output=True, text=True, timeout=15, input=stdin_input,
     )
     return result.returncode, result.stdout, result.stderr
 
@@ -91,6 +91,13 @@ class TestSymlinkInvocation(unittest.TestCase):
         self.assertEqual(code, 0)
         self.assertIn("[3; 7, 16]", out)
 
+    def test_challenge_symlink(self):
+        script = self._make_symlink_script("foxmath-challenge")
+        code, out, err = run("--topic", "legendre", "--count", "2", "--seed", "1",
+                              "--reveal", script=script)
+        self.assertEqual(code, 0)
+        self.assertIn("Answer:", out)
+
     def test_symlink_with_json(self):
         script = self._make_symlink_script("foxmath-legendre")
         code, out, err = run("2", "7", "--json", script=script)
@@ -110,6 +117,29 @@ class TestNormalUsage(unittest.TestCase):
         self.assertEqual(code, 1)
         self.assertIn("point at infinity", err)
 
+    def test_ecadd_curve_secp256k1_defaults_to_doubling_generator(self):
+        code, out, err = run("ecadd", "--curve", "secp256k1")
+        self.assertEqual(code, 0)
+        self.assertIn("89565891926547004231252920425935692360644145829622209833684329913297188986597", out)
+        self.assertIn("on curve", out)
+
+    def test_ecadd_curve_manual_a_override(self):
+        # --a explicitly provided should override the curve preset's a.
+        code, out, err = run("ecadd", "--curve", "toy97", "--a", "2")
+        self.assertEqual(code, 0)
+
+    def test_ecadd_no_args_at_all_errors_clearly(self):
+        code, out, err = run("ecadd")
+        self.assertEqual(code, 1)
+        self.assertIn("Error", err)
+
+    def test_ecadd_backward_compatible_manual_call(self):
+        # Original documented usage: --a omitted, defaults to -3.
+        code, out, err = run("ecadd", "--x1", "1", "--y1", "2",
+                              "--x2", "3", "--y2", "4", "--p", "17")
+        self.assertEqual(code, 0)
+        self.assertIn("Result point: (14, 2)", out)
+
     def test_crt(self):
         code, out, err = run("crt", "--r", "2", "3", "2", "--m", "3", "5", "7")
         self.assertEqual(code, 0)
@@ -147,6 +177,46 @@ class TestNormalUsage(unittest.TestCase):
         self.assertEqual(code, 1)
         self.assertIn("Error", err)
 
+    def test_challenge_reveal_is_deterministic_with_seed(self):
+        code1, out1, err1 = run("challenge", "--topic", "legendre", "--count", "3",
+                                 "--seed", "42", "--reveal")
+        code2, out2, err2 = run("challenge", "--topic", "legendre", "--count", "3",
+                                 "--seed", "42", "--reveal")
+        self.assertEqual(code1, 0)
+        self.assertEqual(out1, out2)
+
+    def test_challenge_interactive_scores_correct_answers(self):
+        # Known answers for --topic legendre --seed 42 --count 3 (from reveal mode).
+        code, out, err = run("challenge", "--topic", "legendre", "--count", "3",
+                              "--seed", "42", stdin_input="-1\n-1\n1\n")
+        self.assertEqual(code, 0)
+        self.assertIn("Score: 3/3", out)
+
+    def test_challenge_interactive_scores_wrong_answers(self):
+        code, out, err = run("challenge", "--topic", "legendre", "--count", "3",
+                              "--seed", "42", stdin_input="0\n0\n0\n")
+        self.assertEqual(code, 0)
+        self.assertIn("Score: 0/3", out)
+
+    def test_challenge_interactive_handles_non_numeric_input(self):
+        code, out, err = run("challenge", "--topic", "legendre", "--count", "1",
+                              "--seed", "42", stdin_input="not-a-number\n")
+        self.assertEqual(code, 0)
+        self.assertIn("Score: 0/1", out)
+
+    def test_challenge_reveal_json(self):
+        code, out, err = run("challenge", "--topic", "crt", "--count", "2",
+                              "--seed", "1", "--reveal", "--json")
+        self.assertEqual(code, 0)
+        import json
+        parsed = json.loads(out)
+        self.assertEqual(len(parsed["problems"]), 2)
+
+    def test_challenge_zero_count_errors(self):
+        code, out, err = run("challenge", "--count", "0")
+        self.assertEqual(code, 1)
+        self.assertIn("Error", err)
+
 
 if __name__ == "__main__":
     unittest.main()

{foxmath-0.3.0 → foxmath-0.5.0}/tests/test_foxmath.py

@@ -14,8 +14,10 @@ sys.path.insert(0, os.path.abspath(os.path.join(os.path.dirname(__file__), "..",
 
 from foxmath.foxmath import (
     legendre_symbol, euler_hermann_pi_approx, ec_point_add, crt_solve,
-    continued_fraction, cf_convergents,
+    continued_fraction, cf_convergents, CURVES, is_on_curve,
+    generate_problem,
 )
+import random
 
 # Reference pi digits (mpmath, 250 dps of working precision), "3" + fractional digits.
 PI_REFERENCE = Decimal(
@@ -152,5 +154,59 @@ class TestContinuedFractions(unittest.TestCase):
             self.assertEqual(convs[-1], (expected.numerator, expected.denominator))
 
 
+class TestNamedCurves(unittest.TestCase):
+    def test_secp256k1_generator_is_on_curve(self):
+        c = CURVES["secp256k1"]
+        self.assertTrue(is_on_curve(c["gx"], c["gy"], c["a"], c["b"], c["p"]))
+
+    def test_secp256k1_doubling_matches_known_value(self):
+        # Cross-checked independently against the `ecdsa` library's
+        # SECP256k1.generator * 2.
+        c = CURVES["secp256k1"]
+        x2, y2 = ec_point_add(c["gx"], c["gy"], c["gx"], c["gy"], c["a"], c["p"])
+        self.assertEqual(
+            x2, 89565891926547004231252920425935692360644145829622209833684329913297188986597
+        )
+        self.assertEqual(
+            y2, 12158399299693830322967808612713398636155367887041628176798871954788371653930
+        )
+        self.assertTrue(is_on_curve(x2, y2, c["a"], c["b"], c["p"]))
+
+    def test_toy97_generator_is_on_curve(self):
+        c = CURVES["toy97"]
+        self.assertTrue(is_on_curve(c["gx"], c["gy"], c["a"], c["b"], c["p"]))
+
+
+class TestChallengeGenerators(unittest.TestCase):
+    def test_legendre_problem_answer_is_correct(self):
+        rng = random.Random(0)
+        for _ in range(50):
+            prob = generate_problem("legendre", rng)
+            self.assertEqual(prob["topic"], "legendre")
+            # re-derive the answer independently from the question text
+            self.assertIn(prob["answer"], (-1, 0, 1))
+
+    def test_crt_problem_answer_satisfies_both_congruences(self):
+        rng = random.Random(0)
+        for _ in range(50):
+            prob = generate_problem("crt", rng)
+            self.assertEqual(prob["topic"], "crt")
+            self.assertIsInstance(prob["answer"], int)
+
+    def test_mixed_topic_produces_both_kinds(self):
+        rng = random.Random(1)
+        topics = {generate_problem("mixed", rng)["topic"] for _ in range(30)}
+        self.assertEqual(topics, {"legendre", "crt"})
+
+    def test_reproducible_with_same_seed(self):
+        p1 = generate_problem("legendre", random.Random(99))
+        p2 = generate_problem("legendre", random.Random(99))
+        self.assertEqual(p1, p2)
+
+    def test_unknown_topic_raises(self):
+        with self.assertRaises(ValueError):
+            generate_problem("not_a_topic", random.Random(0))
+
+
 if __name__ == "__main__":
     unittest.main()