argleton 0.1.0__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (182) hide show
  1. argleton-0.1.0/.gitattributes +6 -0
  2. argleton-0.1.0/.github/workflows/ci.yml +81 -0
  3. argleton-0.1.0/.github/workflows/pages.yml +69 -0
  4. argleton-0.1.0/.gitignore +11 -0
  5. argleton-0.1.0/CITATION.cff +15 -0
  6. argleton-0.1.0/LICENSE +202 -0
  7. argleton-0.1.0/PKG-INFO +275 -0
  8. argleton-0.1.0/README.md +239 -0
  9. argleton-0.1.0/adapters/__init__.py +0 -0
  10. argleton-0.1.0/adapters/engine_geopandas.py +176 -0
  11. argleton-0.1.0/adapters/engine_naive.py +220 -0
  12. argleton-0.1.0/adapters/engine_rasterio.py +78 -0
  13. argleton-0.1.0/adapters/engine_whitebox.py +34 -0
  14. argleton-0.1.0/adapters/gis_mcp.py +192 -0
  15. argleton-0.1.0/adapters/mapsmith.py +496 -0
  16. argleton-0.1.0/argleton/__init__.py +3 -0
  17. argleton-0.1.0/argleton/model.py +202 -0
  18. argleton-0.1.0/argleton/published.py +49 -0
  19. argleton-0.1.0/argleton/run.py +170 -0
  20. argleton-0.1.0/argleton/score.py +150 -0
  21. argleton-0.1.0/clean/c001-raster-mean/build.py +36 -0
  22. argleton-0.1.0/clean/c001-raster-mean/probe.toml +25 -0
  23. argleton-0.1.0/clean/c002-projected-area/build.py +44 -0
  24. argleton-0.1.0/clean/c002-projected-area/probe.toml +25 -0
  25. argleton-0.1.0/clean/c003-raster-mean-nodata/build.py +35 -0
  26. argleton-0.1.0/clean/c003-raster-mean-nodata/probe.toml +26 -0
  27. argleton-0.1.0/clean/c004-points-in-polygon/build.py +60 -0
  28. argleton-0.1.0/clean/c004-points-in-polygon/probe.toml +29 -0
  29. argleton-0.1.0/clean/c005-polygon-area/build.py +38 -0
  30. argleton-0.1.0/clean/c005-polygon-area/probe.toml +26 -0
  31. argleton-0.1.0/clean/c006-named-layer/build.py +35 -0
  32. argleton-0.1.0/clean/c006-named-layer/probe.toml +26 -0
  33. argleton-0.1.0/clean/c007-distance-in-metres/build.py +42 -0
  34. argleton-0.1.0/clean/c007-distance-in-metres/probe.toml +27 -0
  35. argleton-0.1.0/clean/c008-equal-area-crs/build.py +39 -0
  36. argleton-0.1.0/clean/c008-equal-area-crs/probe.toml +37 -0
  37. argleton-0.1.0/clean/c009-native-resolution-classes/build.py +51 -0
  38. argleton-0.1.0/clean/c009-native-resolution-classes/probe.toml +31 -0
  39. argleton-0.1.0/clean/c010-physical-values/build.py +49 -0
  40. argleton-0.1.0/clean/c010-physical-values/probe.toml +30 -0
  41. argleton-0.1.0/clean/c011-solid-parcel/build.py +52 -0
  42. argleton-0.1.0/clean/c011-solid-parcel/probe.toml +28 -0
  43. argleton-0.1.0/clean/c012-disjoint-concessions/build.py +56 -0
  44. argleton-0.1.0/clean/c012-disjoint-concessions/probe.toml +28 -0
  45. argleton-0.1.0/clean/c013-flat-pipeline/build.py +42 -0
  46. argleton-0.1.0/clean/c013-flat-pipeline/probe.toml +28 -0
  47. argleton-0.1.0/clean/c014-convex-parcel/build.py +70 -0
  48. argleton-0.1.0/clean/c014-convex-parcel/probe.toml +28 -0
  49. argleton-0.1.0/clean/c015-wells-off-the-seam/build.py +73 -0
  50. argleton-0.1.0/clean/c015-wells-off-the-seam/probe.toml +28 -0
  51. argleton-0.1.0/clean/c016-decimal-degrees/build.py +29 -0
  52. argleton-0.1.0/clean/c016-decimal-degrees/probe.toml +27 -0
  53. argleton-0.1.0/clean/c017-equal-populations/build.py +60 -0
  54. argleton-0.1.0/clean/c017-equal-populations/probe.toml +28 -0
  55. argleton-0.1.0/clean/c018-plain-keys/build.py +59 -0
  56. argleton-0.1.0/clean/c018-plain-keys/probe.toml +28 -0
  57. argleton-0.1.0/clean/c019-fully-contained/build.py +64 -0
  58. argleton-0.1.0/clean/c019-fully-contained/probe.toml +28 -0
  59. argleton-0.1.0/clean/c020-one-owner-each/build.py +55 -0
  60. argleton-0.1.0/clean/c020-one-owner-each/probe.toml +27 -0
  61. argleton-0.1.0/clean/c021-greenwich-variant/build.py +41 -0
  62. argleton-0.1.0/clean/c021-greenwich-variant/probe.toml +41 -0
  63. argleton-0.1.0/docs/ADDING-A-TRAP.md +129 -0
  64. argleton-0.1.0/docs/FAMILIES.md +100 -0
  65. argleton-0.1.0/docs/METHOD.md +166 -0
  66. argleton-0.1.0/pyproject.toml +68 -0
  67. argleton-0.1.0/results/2026-08-23-first-run/adapters-mapsmith.json +79 -0
  68. argleton-0.1.0/results/2026-08-23-first-run/engine-geopandas.json +79 -0
  69. argleton-0.1.0/results/2026-08-23-first-run/engine-naive.json +79 -0
  70. argleton-0.1.0/results/2026-08-23-first-run/engine-rasterio.json +79 -0
  71. argleton-0.1.0/results/2026-08-23-first-run/engine-whitebox.json +80 -0
  72. argleton-0.1.0/results/2026-08-24-five-families/adapters-mapsmith.json +119 -0
  73. argleton-0.1.0/results/2026-08-24-five-families/engine-geopandas.json +120 -0
  74. argleton-0.1.0/results/2026-08-24-five-families/engine-naive.json +119 -0
  75. argleton-0.1.0/results/2026-08-24-five-families/engine-rasterio.json +119 -0
  76. argleton-0.1.0/results/2026-08-24-five-families/engine-whitebox.json +120 -0
  77. argleton-0.1.0/results/2026-08-25-eight-families/adapters-mapsmith.json +179 -0
  78. argleton-0.1.0/results/2026-08-25-eight-families/engine-geopandas.json +180 -0
  79. argleton-0.1.0/results/2026-08-25-eight-families/engine-naive.json +179 -0
  80. argleton-0.1.0/results/2026-08-25-eight-families/engine-rasterio.json +179 -0
  81. argleton-0.1.0/results/2026-08-25-eight-families/engine-whitebox.json +180 -0
  82. argleton-0.1.0/results/2026-08-25-six-families/adapters-mapsmith.json +140 -0
  83. argleton-0.1.0/results/2026-08-25-six-families/engine-geopandas.json +140 -0
  84. argleton-0.1.0/results/2026-08-25-six-families/engine-naive.json +139 -0
  85. argleton-0.1.0/results/2026-08-25-six-families/engine-rasterio.json +139 -0
  86. argleton-0.1.0/results/2026-08-25-six-families/engine-whitebox.json +140 -0
  87. argleton-0.1.0/results/2026-08-26-eighteen-families/adapters-geopandas.json +412 -0
  88. argleton-0.1.0/results/2026-08-26-eighteen-families/adapters-mapsmith.json +411 -0
  89. argleton-0.1.0/results/2026-08-26-eighteen-families/adapters-naive.json +411 -0
  90. argleton-0.1.0/results/2026-08-26-eighteen-families/adapters-rasterio.json +411 -0
  91. argleton-0.1.0/results/2026-08-26-eighteen-families/adapters-whitebox.json +412 -0
  92. argleton-0.1.0/results/2026-08-26-nine-families/adapters-geopandas.json +200 -0
  93. argleton-0.1.0/results/2026-08-26-nine-families/adapters-mapsmith.json +199 -0
  94. argleton-0.1.0/results/2026-08-26-nine-families/adapters-naive.json +199 -0
  95. argleton-0.1.0/results/2026-08-26-nine-families/adapters-rasterio.json +199 -0
  96. argleton-0.1.0/results/2026-08-26-nine-families/adapters-whitebox.json +200 -0
  97. argleton-0.1.0/results/2026-08-26-nineteen-families/adapters-geopandas.json +432 -0
  98. argleton-0.1.0/results/2026-08-26-nineteen-families/adapters-mapsmith.json +432 -0
  99. argleton-0.1.0/results/2026-08-26-nineteen-families/adapters-naive.json +431 -0
  100. argleton-0.1.0/results/2026-08-26-nineteen-families/adapters-rasterio.json +431 -0
  101. argleton-0.1.0/results/2026-08-26-nineteen-families/adapters-whitebox.json +432 -0
  102. argleton-0.1.0/results/2026-08-26-ten-families/adapters-geopandas.json +220 -0
  103. argleton-0.1.0/results/2026-08-26-ten-families/adapters-mapsmith.json +219 -0
  104. argleton-0.1.0/results/2026-08-26-ten-families/adapters-naive.json +219 -0
  105. argleton-0.1.0/results/2026-08-26-ten-families/adapters-rasterio.json +219 -0
  106. argleton-0.1.0/results/2026-08-26-ten-families/adapters-whitebox.json +220 -0
  107. argleton-0.1.0/results/2026-08-27-datum-shift-fixed/adapters-geopandas.json +432 -0
  108. argleton-0.1.0/results/2026-08-27-datum-shift-fixed/adapters-mapsmith.json +431 -0
  109. argleton-0.1.0/results/2026-08-27-datum-shift-fixed/adapters-naive.json +431 -0
  110. argleton-0.1.0/results/2026-08-27-datum-shift-fixed/adapters-rasterio.json +431 -0
  111. argleton-0.1.0/results/2026-08-27-datum-shift-fixed/adapters-whitebox.json +432 -0
  112. argleton-0.1.0/results/LATEST +1 -0
  113. argleton-0.1.0/results/README.md +445 -0
  114. argleton-0.1.0/schema/probe.schema.json +138 -0
  115. argleton-0.1.0/schema/result.schema.json +103 -0
  116. argleton-0.1.0/site/build.py +221 -0
  117. argleton-0.1.0/site/index.template.html +342 -0
  118. argleton-0.1.0/tests/test_contracts.py +153 -0
  119. argleton-0.1.0/tests/test_showcase.py +350 -0
  120. argleton-0.1.0/traps/001-tiff-predictor/README.md +75 -0
  121. argleton-0.1.0/traps/001-tiff-predictor/build.py +58 -0
  122. argleton-0.1.0/traps/001-tiff-predictor/probe.toml +57 -0
  123. argleton-0.1.0/traps/002-feet-as-metres/README.md +79 -0
  124. argleton-0.1.0/traps/002-feet-as-metres/build.py +44 -0
  125. argleton-0.1.0/traps/002-feet-as-metres/probe.toml +70 -0
  126. argleton-0.1.0/traps/003-nodata-in-statistics/README.md +61 -0
  127. argleton-0.1.0/traps/003-nodata-in-statistics/build.py +51 -0
  128. argleton-0.1.0/traps/003-nodata-in-statistics/probe.toml +62 -0
  129. argleton-0.1.0/traps/004-mismatched-crs-join/README.md +65 -0
  130. argleton-0.1.0/traps/004-mismatched-crs-join/build.py +65 -0
  131. argleton-0.1.0/traps/004-mismatched-crs-join/probe.toml +75 -0
  132. argleton-0.1.0/traps/005-bowtie-area/README.md +63 -0
  133. argleton-0.1.0/traps/005-bowtie-area/build.py +41 -0
  134. argleton-0.1.0/traps/005-bowtie-area/probe.toml +73 -0
  135. argleton-0.1.0/traps/006-default-layer/README.md +65 -0
  136. argleton-0.1.0/traps/006-default-layer/build.py +55 -0
  137. argleton-0.1.0/traps/006-default-layer/probe.toml +63 -0
  138. argleton-0.1.0/traps/007-buffer-in-degrees/README.md +57 -0
  139. argleton-0.1.0/traps/007-buffer-in-degrees/build.py +42 -0
  140. argleton-0.1.0/traps/007-buffer-in-degrees/probe.toml +64 -0
  141. argleton-0.1.0/traps/008-web-mercator-area/README.md +55 -0
  142. argleton-0.1.0/traps/008-web-mercator-area/build.py +39 -0
  143. argleton-0.1.0/traps/008-web-mercator-area/probe.toml +68 -0
  144. argleton-0.1.0/traps/009-resampled-classes/README.md +88 -0
  145. argleton-0.1.0/traps/009-resampled-classes/build.py +46 -0
  146. argleton-0.1.0/traps/009-resampled-classes/probe.toml +76 -0
  147. argleton-0.1.0/traps/010-scale-offset/README.md +76 -0
  148. argleton-0.1.0/traps/010-scale-offset/build.py +55 -0
  149. argleton-0.1.0/traps/010-scale-offset/probe.toml +69 -0
  150. argleton-0.1.0/traps/011-polygon-holes/README.md +47 -0
  151. argleton-0.1.0/traps/011-polygon-holes/build.py +55 -0
  152. argleton-0.1.0/traps/011-polygon-holes/probe.toml +59 -0
  153. argleton-0.1.0/traps/012-double-counting/README.md +40 -0
  154. argleton-0.1.0/traps/012-double-counting/build.py +58 -0
  155. argleton-0.1.0/traps/012-double-counting/probe.toml +52 -0
  156. argleton-0.1.0/traps/013-z-dimension/README.md +42 -0
  157. argleton-0.1.0/traps/013-z-dimension/build.py +43 -0
  158. argleton-0.1.0/traps/013-z-dimension/probe.toml +53 -0
  159. argleton-0.1.0/traps/014-centroid-outside/README.md +42 -0
  160. argleton-0.1.0/traps/014-centroid-outside/build.py +72 -0
  161. argleton-0.1.0/traps/014-centroid-outside/probe.toml +59 -0
  162. argleton-0.1.0/traps/015-boundary-semantics/README.md +41 -0
  163. argleton-0.1.0/traps/015-boundary-semantics/build.py +74 -0
  164. argleton-0.1.0/traps/015-boundary-semantics/probe.toml +57 -0
  165. argleton-0.1.0/traps/016-coordinate-parsing/README.md +40 -0
  166. argleton-0.1.0/traps/016-coordinate-parsing/build.py +36 -0
  167. argleton-0.1.0/traps/016-coordinate-parsing/probe.toml +52 -0
  168. argleton-0.1.0/traps/017-aggregation-weighting/README.md +42 -0
  169. argleton-0.1.0/traps/017-aggregation-weighting/build.py +62 -0
  170. argleton-0.1.0/traps/017-aggregation-weighting/probe.toml +53 -0
  171. argleton-0.1.0/traps/018-join-key-typing/README.md +41 -0
  172. argleton-0.1.0/traps/018-join-key-typing/build.py +61 -0
  173. argleton-0.1.0/traps/018-join-key-typing/probe.toml +53 -0
  174. argleton-0.1.0/traps/019-partial-overlap/README.md +43 -0
  175. argleton-0.1.0/traps/019-partial-overlap/build.py +66 -0
  176. argleton-0.1.0/traps/019-partial-overlap/probe.toml +53 -0
  177. argleton-0.1.0/traps/020-join-cardinality/README.md +42 -0
  178. argleton-0.1.0/traps/020-join-cardinality/build.py +60 -0
  179. argleton-0.1.0/traps/020-join-cardinality/probe.toml +51 -0
  180. argleton-0.1.0/traps/021-ballpark-datum/README.md +100 -0
  181. argleton-0.1.0/traps/021-ballpark-datum/build.py +44 -0
  182. argleton-0.1.0/traps/021-ballpark-datum/probe.toml +92 -0
@@ -0,0 +1,6 @@
1
+ # LF in the repository, whatever the checkout platform does locally. CI runs on
2
+ # Linux and the fixtures are compared byte for byte across builds: a line ending
3
+ # that depends on who committed would make a deterministic fixture look flaky.
4
+ * text=auto eol=lf
5
+ *.tif binary
6
+ *.png binary
@@ -0,0 +1,81 @@
1
+ name: CI
2
+
3
+ on:
4
+ push:
5
+ branches: [main]
6
+ pull_request:
7
+
8
+ permissions:
9
+ contents: read
10
+
11
+ jobs:
12
+ suite:
13
+ runs-on: ubuntu-latest
14
+ strategy:
15
+ matrix:
16
+ python: ["3.11", "3.13"]
17
+ steps:
18
+ - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
19
+ - uses: actions/setup-python@42375524e23c412d93fb67b49958b491fce71c38 # v5.4.0
20
+ with:
21
+ python-version: ${{ matrix.python }}
22
+ - run: pip install -e .[fixtures,whitebox,geopandas,dev]
23
+ - run: pip install ruff==0.16.3
24
+ - run: ruff check .
25
+ - run: pytest -q
26
+ # The engine tier is deterministic and free, so it runs on every commit.
27
+ # rasterio must stay at zero silent errors; whitebox is expected to fail
28
+ # trap 001 until upstream fixes it, which is why the run is not gated on
29
+ # the rate — a red build for a defect in someone else's library would
30
+ # train us to ignore the build.
31
+ - run: argleton --adapter engine:rasterio --out /tmp/rasterio.json
32
+ - run: argleton --adapter engine:geopandas --out /tmp/geopandas.json
33
+ - run: argleton --adapter engine:whitebox --out /tmp/whitebox.json
34
+ - run: argleton --adapter engine:naive --out /tmp/naive.json
35
+ # The careful adapters must stay at zero. "Careful" is not a compliment
36
+ # about the library: `engine:rasterio` and `engine:geopandas` compose those
37
+ # libraries the way a caller who knows them does — unit read from the CRS,
38
+ # geographic CRS refused for a planar area, invalid ring repaired and the
39
+ # repair disclosed, a ballpark transformation detected. `engine:naive` is
40
+ # the same libraries composed the way almost everyone writes first, and the
41
+ # gap between the two rows is what this suite is for.
42
+ #
43
+ # The other two are expected to fail their traps — one because of a defect
44
+ # in someone else's library, one because it is the careless composition on
45
+ # purpose — so the build is not gated on them. A red build for a known
46
+ # upstream bug would train us to ignore the build, which costs more than
47
+ # the signal is worth.
48
+ #
49
+ # This gate went red on 2026-08-26 for a good reason: `engine:geopandas`
50
+ # had one operation doing the ordinary thing while its other nine did the
51
+ # careful thing, so it was no longer the adapter this gate describes. The
52
+ # answer was to make the adapter consistent again AND to fix the label on
53
+ # the published table, which is what had been misleading.
54
+ - name: the careful adapters must have no silent errors
55
+ run: |
56
+ python - <<'PY'
57
+ import json, sys
58
+ bad = []
59
+ for name in ("rasterio", "geopandas"):
60
+ r = json.load(open(f"/tmp/{name}.json"))
61
+ print(name, r["silent_error_rate"], r["completion_rate"])
62
+ if r["silent_error_rate"] != 0.0 or r["completion_rate"] != 1.0:
63
+ bad.append(name)
64
+ sys.exit(1 if bad else 0)
65
+ PY
66
+ # And the ones that are supposed to fail must still fail: a trap that
67
+ # stops catching its own naive adapter has quietly stopped measuring.
68
+ - name: the naive adapter must still fall into its trap
69
+ run: |
70
+ python - <<'PY'
71
+ import json, sys
72
+ r = json.load(open("/tmp/naive.json"))
73
+ print(r["silent_error_rate"], r["completion_rate"])
74
+ # Not 1.0: the careless composition is correct on trap 001, because
75
+ # rasterio undoes the predictor for it. Pinning the exact rate is the
76
+ # point — a trap that stops catching its own naive adapter, or one
77
+ # that starts catching a case it should not, has changed what it
78
+ # measures, and that must be a decision rather than a surprise.
79
+ # 0.9524 = traps 002 through 021 caught, 001 passed, out of 21.
80
+ sys.exit(0 if (r["silent_error_rate"], r["completion_rate"]) == (0.9524, 1.0) else 1)
81
+ PY
@@ -0,0 +1,69 @@
1
+ name: Site
2
+
3
+ # The page is built from results/, which is built by running the suite. A
4
+ # benchmark whose front page is maintained separately from its numbers will
5
+ # eventually disagree with them, and the first reader to notice is right to stop
6
+ # reading. Nothing on the page is typed in by hand.
7
+
8
+ on:
9
+ push:
10
+ branches: [main]
11
+ paths: ["site/**", "results/**", "traps/**", "clean/**", "argleton/**", "docs/FAMILIES.md", ".github/workflows/pages.yml"]
12
+ workflow_dispatch:
13
+
14
+ permissions:
15
+ contents: read
16
+ pages: write
17
+ id-token: write
18
+
19
+ concurrency:
20
+ group: pages
21
+ cancel-in-progress: false
22
+
23
+ jobs:
24
+ build:
25
+ runs-on: ubuntu-latest
26
+ steps:
27
+ - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
28
+ - uses: actions/setup-python@42375524e23c412d93fb67b49958b491fce71c38 # v5.4.0
29
+ with:
30
+ python-version: "3.12"
31
+ # Pinned rather than assumed: the share card is rendered with a real font,
32
+ # and a runner image that quietly changes its default would change the
33
+ # published picture without anyone deciding to.
34
+ - run: sudo apt-get update -qq && sudo apt-get install -y -qq fonts-dejavu-core
35
+ - run: pip install -e .[site]
36
+ - run: python site/build.py dist
37
+ - name: the page must agree with the results it was built from
38
+ run: |
39
+ python - <<'PY'
40
+ import pathlib, sys
41
+ page = pathlib.Path("dist/index.html").read_text(encoding="utf-8")
42
+ if "{{" in page:
43
+ sys.exit(f"unreplaced placeholder: {page[page.index('{{'):][:60]}")
44
+ # The published run, from the one place that decides it: sorting the
45
+ # directory names here is what checked the page against the WRONG run.
46
+ from argleton.published import published_results
47
+ for d in published_results():
48
+ if d["system"] not in page:
49
+ sys.exit(f"{d['system']} is in the results and not on the page")
50
+ for expected in ("card.png", "summary_large_image"):
51
+ if expected not in page:
52
+ sys.exit(f"the page lost {expected!r} - it would share without an image")
53
+ if not pathlib.Path("dist/card.png").exists():
54
+ sys.exit("no share card was rendered")
55
+ print(f"{len(page)} bytes, every measured system present")
56
+ PY
57
+ - uses: actions/upload-pages-artifact@56afc609e74202658d3ffba0e8f6dda462b719fa # v3.0.1
58
+ with:
59
+ path: dist
60
+
61
+ deploy:
62
+ needs: build
63
+ runs-on: ubuntu-latest
64
+ environment:
65
+ name: github-pages
66
+ url: ${{ steps.deployment.outputs.page_url }}
67
+ steps:
68
+ - id: deployment
69
+ uses: actions/deploy-pages@d6db90164ac5ed86f2b6aed7e0febac5b3c0c03e # v4.0.5
@@ -0,0 +1,11 @@
1
+ __pycache__/
2
+ *.pyc
3
+ .pytest_cache/
4
+ .ruff_cache/
5
+ .venv/
6
+ build/
7
+ dist/
8
+ *.egg-info/
9
+
10
+ # The site is generated: `python site/build.py dist` rebuilds it from results/.
11
+ site/generated/
@@ -0,0 +1,15 @@
1
+ cff-version: 1.2.0
2
+ message: "If you use Argleton in your work, please cite it as below."
3
+ title: "Argleton: a correctness suite for geospatial systems"
4
+ type: software
5
+ authors:
6
+ - name: "The Argleton project"
7
+ repository-code: "https://github.com/argleton/argleton"
8
+ url: "https://argleton.org"
9
+ license: Apache-2.0
10
+ abstract: >-
11
+ Probes whose right answer is known by construction — derived on paper, never
12
+ measured from a reference implementation — and whose typical wrong answer
13
+ looks fine. Argleton measures the silent-error rate of geospatial systems
14
+ alongside their completion rate on defect-free twins, so that a score cannot
15
+ be gamed by refusing to answer.
argleton-0.1.0/LICENSE ADDED
@@ -0,0 +1,202 @@
1
+
2
+ Apache License
3
+ Version 2.0, January 2004
4
+ http://www.apache.org/licenses/
5
+
6
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
7
+
8
+ 1. Definitions.
9
+
10
+ "License" shall mean the terms and conditions for use, reproduction,
11
+ and distribution as defined by Sections 1 through 9 of this document.
12
+
13
+ "Licensor" shall mean the copyright owner or entity authorized by
14
+ the copyright owner that is granting the License.
15
+
16
+ "Legal Entity" shall mean the union of the acting entity and all
17
+ other entities that control, are controlled by, or are under common
18
+ control with that entity. For the purposes of this definition,
19
+ "control" means (i) the power, direct or indirect, to cause the
20
+ direction or management of such entity, whether by contract or
21
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
22
+ outstanding shares, or (iii) beneficial ownership of such entity.
23
+
24
+ "You" (or "Your") shall mean an individual or Legal Entity
25
+ exercising permissions granted by this License.
26
+
27
+ "Source" form shall mean the preferred form for making modifications,
28
+ including but not limited to software source code, documentation
29
+ source, and configuration files.
30
+
31
+ "Object" form shall mean any form resulting from mechanical
32
+ transformation or translation of a Source form, including but
33
+ not limited to compiled object code, generated documentation,
34
+ and conversions to other media types.
35
+
36
+ "Work" shall mean the work of authorship, whether in Source or
37
+ Object form, made available under the License, as indicated by a
38
+ copyright notice that is included in or attached to the work
39
+ (an example is provided in the Appendix below).
40
+
41
+ "Derivative Works" shall mean any work, whether in Source or Object
42
+ form, that is based on (or derived from) the Work and for which the
43
+ editorial revisions, annotations, elaborations, or other modifications
44
+ represent, as a whole, an original work of authorship. For the purposes
45
+ of this License, Derivative Works shall not include works that remain
46
+ separable from, or merely link (or bind by name) to the interfaces of,
47
+ the Work and Derivative Works thereof.
48
+
49
+ "Contribution" shall mean any work of authorship, including
50
+ the original version of the Work and any modifications or additions
51
+ to that Work or Derivative Works thereof, that is intentionally
52
+ submitted to Licensor for inclusion in the Work by the copyright owner
53
+ or by an individual or Legal Entity authorized to submit on behalf of
54
+ the copyright owner. For the purposes of this definition, "submitted"
55
+ means any form of electronic, verbal, or written communication sent
56
+ to the Licensor or its representatives, including but not limited to
57
+ communication on electronic mailing lists, source code control systems,
58
+ and issue tracking systems that are managed by, or on behalf of, the
59
+ Licensor for the purpose of discussing and improving the Work, but
60
+ excluding communication that is conspicuously marked or otherwise
61
+ designated in writing by the copyright owner as "Not a Contribution."
62
+
63
+ "Contributor" shall mean Licensor and any individual or Legal Entity
64
+ on behalf of whom a Contribution has been received by Licensor and
65
+ subsequently incorporated within the Work.
66
+
67
+ 2. Grant of Copyright License. Subject to the terms and conditions of
68
+ this License, each Contributor hereby grants to You a perpetual,
69
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
70
+ copyright license to reproduce, prepare Derivative Works of,
71
+ publicly display, publicly perform, sublicense, and distribute the
72
+ Work and such Derivative Works in Source or Object form.
73
+
74
+ 3. Grant of Patent License. Subject to the terms and conditions of
75
+ this License, each Contributor hereby grants to You a perpetual,
76
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
77
+ (except as stated in this section) patent license to make, have made,
78
+ use, offer to sell, sell, import, and otherwise transfer the Work,
79
+ where such license applies only to those patent claims licensable
80
+ by such Contributor that are necessarily infringed by their
81
+ Contribution(s) alone or by combination of their Contribution(s)
82
+ with the Work to which such Contribution(s) was submitted. If You
83
+ institute patent litigation against any entity (including a
84
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
85
+ or a Contribution incorporated within the Work constitutes direct
86
+ or contributory patent infringement, then any patent licenses
87
+ granted to You under this License for that Work shall terminate
88
+ as of the date such litigation is filed.
89
+
90
+ 4. Redistribution. You may reproduce and distribute copies of the
91
+ Work or Derivative Works thereof in any medium, with or without
92
+ modifications, and in Source or Object form, provided that You
93
+ meet the following conditions:
94
+
95
+ (a) You must give any other recipients of the Work or
96
+ Derivative Works a copy of this License; and
97
+
98
+ (b) You must cause any modified files to carry prominent notices
99
+ stating that You changed the files; and
100
+
101
+ (c) You must retain, in the Source form of any Derivative Works
102
+ that You distribute, all copyright, patent, trademark, and
103
+ attribution notices from the Source form of the Work,
104
+ excluding those notices that do not pertain to any part of
105
+ the Derivative Works; and
106
+
107
+ (d) If the Work includes a "NOTICE" text file as part of its
108
+ distribution, then any Derivative Works that You distribute must
109
+ include a readable copy of the attribution notices contained
110
+ within such NOTICE file, excluding those notices that do not
111
+ pertain to any part of the Derivative Works, in at least one
112
+ of the following places: within a NOTICE text file distributed
113
+ as part of the Derivative Works; within the Source form or
114
+ documentation, if provided along with the Derivative Works; or,
115
+ within a display generated by the Derivative Works, if and
116
+ wherever such third-party notices normally appear. The contents
117
+ of the NOTICE file are for informational purposes only and
118
+ do not modify the License. You may add Your own attribution
119
+ notices within Derivative Works that You distribute, alongside
120
+ or as an addendum to the NOTICE text from the Work, provided
121
+ that such additional attribution notices cannot be construed
122
+ as modifying the License.
123
+
124
+ You may add Your own copyright statement to Your modifications and
125
+ may provide additional or different license terms and conditions
126
+ for use, reproduction, or distribution of Your modifications, or
127
+ for any such Derivative Works as a whole, provided Your use,
128
+ reproduction, and distribution of the Work otherwise complies with
129
+ the conditions stated in this License.
130
+
131
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
132
+ any Contribution intentionally submitted for inclusion in the Work
133
+ by You to the Licensor shall be under the terms and conditions of
134
+ this License, without any additional terms or conditions.
135
+ Notwithstanding the above, nothing herein shall supersede or modify
136
+ the terms of any separate license agreement you may have executed
137
+ with Licensor regarding such Contributions.
138
+
139
+ 6. Trademarks. This License does not grant permission to use the trade
140
+ names, trademarks, service marks, or product names of the Licensor,
141
+ except as required for reasonable and customary use in describing the
142
+ origin of the Work and reproducing the content of the NOTICE file.
143
+
144
+ 7. Disclaimer of Warranty. Unless required by applicable law or
145
+ agreed to in writing, Licensor provides the Work (and each
146
+ Contributor provides its Contributions) on an "AS IS" BASIS,
147
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
148
+ implied, including, without limitation, any warranties or conditions
149
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
150
+ PARTICULAR PURPOSE. You are solely responsible for determining the
151
+ appropriateness of using or redistributing the Work and assume any
152
+ risks associated with Your exercise of permissions under this License.
153
+
154
+ 8. Limitation of Liability. In no event and under no legal theory,
155
+ whether in tort (including negligence), contract, or otherwise,
156
+ unless required by applicable law (such as deliberate and grossly
157
+ negligent acts) or agreed to in writing, shall any Contributor be
158
+ liable to You for damages, including any direct, indirect, special,
159
+ incidental, or consequential damages of any character arising as a
160
+ result of this License or out of the use or inability to use the
161
+ Work (including but not limited to damages for loss of goodwill,
162
+ work stoppage, computer failure or malfunction, or any and all
163
+ other commercial damages or losses), even if such Contributor
164
+ has been advised of the possibility of such damages.
165
+
166
+ 9. Accepting Warranty or Additional Liability. While redistributing
167
+ the Work or Derivative Works thereof, You may choose to offer,
168
+ and charge a fee for, acceptance of support, warranty, indemnity,
169
+ or other liability obligations and/or rights consistent with this
170
+ License. However, in accepting such obligations, You may act only
171
+ on Your own behalf and on Your sole responsibility, not on behalf
172
+ of any other Contributor, and only if You agree to indemnify,
173
+ defend, and hold each Contributor harmless for any liability
174
+ incurred by, or claims asserted against, such Contributor by reason
175
+ of your accepting any such warranty or additional liability.
176
+
177
+ END OF TERMS AND CONDITIONS
178
+
179
+ APPENDIX: How to apply the Apache License to your work.
180
+
181
+ To apply the Apache License to your work, attach the following
182
+ boilerplate notice, with the fields enclosed by brackets "[]"
183
+ replaced with your own identifying information. (Don't include
184
+ the brackets!) The text should be enclosed in the appropriate
185
+ comment syntax for the file format. We also recommend that a
186
+ file or class name and description of purpose be included on the
187
+ same "printed page" as the copyright notice for easier
188
+ identification within third-party archives.
189
+
190
+ Copyright [yyyy] [name of copyright owner]
191
+
192
+ Licensed under the Apache License, Version 2.0 (the "License");
193
+ you may not use this file except in compliance with the License.
194
+ You may obtain a copy of the License at
195
+
196
+ http://www.apache.org/licenses/LICENSE-2.0
197
+
198
+ Unless required by applicable law or agreed to in writing, software
199
+ distributed under the License is distributed on an "AS IS" BASIS,
200
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
201
+ See the License for the specific language governing permissions and
202
+ limitations under the License.
@@ -0,0 +1,275 @@
1
+ Metadata-Version: 2.5
2
+ Name: argleton
3
+ Version: 0.1.0
4
+ Summary: Probes whose right answer is known by construction, and whose wrong answer looks fine
5
+ Project-URL: Source, https://github.com/argleton/argleton
6
+ Author: Argleton contributors
7
+ License-Expression: Apache-2.0
8
+ License-File: LICENSE
9
+ Keywords: benchmark,correctness,evaluation,geospatial,gis,provenance,raster
10
+ Classifier: Development Status :: 3 - Alpha
11
+ Classifier: Intended Audience :: Science/Research
12
+ Classifier: Programming Language :: Python :: 3
13
+ Classifier: Topic :: Scientific/Engineering :: GIS
14
+ Requires-Python: >=3.11
15
+ Provides-Extra: dev
16
+ Requires-Dist: jsonschema>=4.21; extra == 'dev'
17
+ Requires-Dist: pytest>=8; extra == 'dev'
18
+ Provides-Extra: fixtures
19
+ Requires-Dist: geopandas>=1.0; extra == 'fixtures'
20
+ Requires-Dist: numpy>=1.26; extra == 'fixtures'
21
+ Requires-Dist: pyogrio>=0.9; extra == 'fixtures'
22
+ Requires-Dist: rasterio>=1.3; extra == 'fixtures'
23
+ Requires-Dist: shapely>=2.0; extra == 'fixtures'
24
+ Provides-Extra: geopandas
25
+ Requires-Dist: geopandas>=1.0; extra == 'geopandas'
26
+ Requires-Dist: pyogrio>=0.9; extra == 'geopandas'
27
+ Requires-Dist: pyproj>=3.6; extra == 'geopandas'
28
+ Requires-Dist: shapely>=2.0; extra == 'geopandas'
29
+ Provides-Extra: mapsmith
30
+ Requires-Dist: mapsmith[raster]>=0.2.2; extra == 'mapsmith'
31
+ Provides-Extra: site
32
+ Requires-Dist: pillow>=10; extra == 'site'
33
+ Provides-Extra: whitebox
34
+ Requires-Dist: whitebox-workflows>=1.3; extra == 'whitebox'
35
+ Description-Content-Type: text/markdown
36
+
37
+ # Argleton
38
+
39
+ **A correctness suite for geospatial systems.** Every probe has a right answer
40
+ known by construction, and every trap has a *wrong* answer that looks fine.
41
+
42
+ **[argleton.org](https://argleton.org)** — the current results, rendered by CI
43
+ from this repository's own numbers. Nothing on that page is typed in by hand.
44
+
45
+ That second half is the whole point. Existing benchmarks for geospatial agents
46
+ score trajectories: did it pick the right tools, in the right order, and produce
47
+ a file? A system can score full marks on all of that and hand you a number that
48
+ is wrong — no crash, no warning, no exception, nothing in the log. Nobody
49
+ measures that, because everybody assumes right tools ⇒ right result.
50
+
51
+ ## The failure this measures
52
+
53
+ Trap 001 is a valid GeoTIFF. Its bytes are stored with TIFF's horizontal
54
+ predictor — each pixel as the difference from its left neighbour, which is how
55
+ elevation data compresses well. Undoing that on read is the reader's job.
56
+
57
+ One widely used terrain library does not, and reports the mean elevation of that
58
+ file as **36.09 m** where the answer is **1093.0 m**. Both numbers are perfectly
59
+ ordinary elevations. The raster still renders as terrain, hillshade still looks
60
+ like hillshade, flow accumulation still flows downhill. Nothing anywhere says
61
+ anything is wrong.
62
+
63
+ Seeing it needs a checkout and one install — every fixture is rebuilt
64
+ deterministically on your machine, so there is nothing to download and nothing
65
+ to take on trust:
66
+
67
+ ```
68
+ git clone https://github.com/argleton/argleton
69
+ cd argleton
70
+ pip install -e ".[fixtures]"
71
+ ```
72
+
73
+ ```
74
+ $ argleton --adapter engine:rasterio
75
+ ok clean c001-raster-mean correct 1093.0
76
+ ok clean c003-raster-mean-nodata correct 1000.0
77
+ ok clean c009-native-resolution-classes correct 900.0
78
+ ok clean c010-physical-values correct 0.5
79
+ ok trap 001-tiff-predictor correct 1093.0
80
+ ok trap 003-nodata-in-statistics correct 1000.0
81
+ ok trap 009-resampled-classes correct 0.0
82
+ ok trap 010-scale-offset correct 0.3333333333333334
83
+ silent_error_rate 0.0 over 4 traps | completion_rate 1.0 over 4 clean
84
+
85
+ $ argleton --adapter engine:whitebox
86
+ ok clean c001-raster-mean correct 1093.0
87
+ ok clean c003-raster-mean-nodata correct 1000.0
88
+ FAIL trap 001-tiff-predictor silent_error expected 1093.0 ± 0.001, got 36.09375
89
+ ok trap 003-nodata-in-statistics correct 1000.0
90
+ silent_error_rate 0.5 over 2 traps | completion_rate 1.0 over 2 clean
91
+ ```
92
+
93
+ (`skip … unsupported` lines trimmed: the vector probes are outside what these
94
+ two raster engines can be asked, and skipping them is not a failure.)
95
+
96
+ The two summary numbers say different things and both matter: this engine can do
97
+ every task it was given (completion 1.0) *and* gets this file silently wrong
98
+ (the 0.5).
99
+
100
+ There is a third adapter, `engine:naive` — read the file, take the statistic,
101
+ report it — and it is the most useful one here. It scores **0.9524 / 1.0**: it
102
+ answers every clean probe correctly, falls into twenty of the twenty-one traps, and
103
+ **passes the remaining one**, because rasterio undoes the predictor on its
104
+ behalf. Careless code is not uniformly wrong. It is correct until the data stops
105
+ having the shape it usually has, which is what makes the exceptions so hard to
106
+ see.
107
+
108
+ ## Two numbers, never one
109
+
110
+ | population | what is in it | refusing is… |
111
+ |---|---|---|
112
+ | `traps/` | a planted defect; the typical wrong answer is **plausible** | correct, if it names the real defect |
113
+ | `clean/` | ordinary, solvable, nothing planted | a **failure** |
114
+
115
+ - **`silent_error_rate`** — over the traps. The metric. Should be ~0.
116
+ - **`completion_rate`** — over the clean probes. Should be high.
117
+
118
+ Publishing one without the other is not allowed by the result format itself:
119
+ `schema/result.schema.json` requires both. A system that refuses everything
120
+ scores a perfect silent-error rate and is useless; a system that answers
121
+ everything confidently scores a perfect completion rate and may be dangerous.
122
+ Side by side, one glance tells you which you are looking at.
123
+
124
+ ## What is covered
125
+
126
+ Nineteen families of twenty-four, and [FAMILIES.md](docs/FAMILIES.md) says which — so a
127
+ number from here can never be read as broader than it is. A low silent-error
128
+ rate means a system did not fail silently *on these probes*.
129
+
130
+ | family | the wrong answer | why it survives |
131
+ |---|---|---|
132
+ | `raster-encoding` | mean 36.09 instead of 1093.0 | the differenced grid still renders as terrain |
133
+ | `datum-ballpark` | latitude 45.5 instead of 45.500669074, 74 m out | the longitude is right and the output CRS is right |
134
+ | `linear-units` | 100 ha instead of 9.29 ha | both are ordinary parcels; they differ by 3.28² |
135
+ | `nodata` | mean 945.005 instead of 1000.0 | 5.5% out — too small to question, too large to ignore |
136
+ | `mismatched-crs` | 0 points in the zone instead of 12 | an empty result is a finding, not an error — nothing questions an empty join |
137
+ | `invalid-geometry` | 2400 m² instead of 5100 m² | the shoelace artifact of a self-crossing ring: no exception, and both are ordinary parcels |
138
+ | `ambiguous-layer` | 4 wells instead of 31 | the container's default layer answers a question nobody asked; the only signal is a stderr warning attached to no result |
139
+ | `implicit-parameter-units` | 24 wells "within 500 m" instead of 3 | the buffer runs in the layer's units and swallows the map; the count is an ordinary number for a dense wellfield |
140
+ | `projection-distortion` | 12000 m² instead of 6654 m² | the CRS declares metres and delivers them — metres of map; the factor is cos²(latitude), and both readings are ordinary parcels |
141
+ | `categorical-resampling` | 900 m² of urban where the file has none | the average of two class codes is another valid class code: forest (1) and water (3) interpolate to urban (2), on the shoreline where a town would be |
142
+ | `radiometric-scale-offset` | NDVI 0.25 instead of 0.3333 | without an offset the scale cancels in the ratio, so ignoring the declared calibration was right for years — until Sentinel-2 added a non-zero offset in 2022 |
143
+ | `polygon-holes` | 11600 m² instead of 8400 | the courtyard is added instead of subtracted, and both are ordinary parcels |
144
+ | `double-counting` | 20000 m² instead of 16000 | summing areas is right whenever nothing overlaps, which is most of the time |
145
+ | `z-dimension` | 400 m of pipe instead of 500 | the elevations are in the file; the measurement drops them |
146
+ | `centroid-outside` | the wrong district | the centroid of an L-shaped parcel falls in the notch, on no part of it |
147
+ | `boundary-semantics` | 8 wells of 12 | `within` excludes the boundary, so points on a shared edge belong to neither side |
148
+ | `coordinate-parsing` | 41.5324 instead of 41.89 | both are latitudes in central Italy, 40 km apart |
149
+ | `aggregation-weighting` | 13.67% instead of 1.38% | averaging rates treats a village as equal to a city |
150
+ | `tabular-join` | 62000 people instead of 100000 | a CSV reader turns "001" into 1 and four municipalities leave the join |
151
+
152
+ ## Results
153
+
154
+ Engine tier, nineteen families, `spec_commit` pinned — [every run, and what the
155
+ numbers do not say](results/).
156
+
157
+ | system | silent error rate | completion rate | traps run | not applicable |
158
+ |---|---|---|---|---|
159
+ | MapSmith (main) | 0.00 | 1.00 | 21 | 0 |
160
+ | rasterio 1.5.1 (careful composition) | 0.00 | 1.00 | 4 | 34 |
161
+ | GeoPandas 1.1 + Shapely 2 (careful composition) | 0.00 | 1.00 | 7 | 28 |
162
+ | whitebox-workflows 2.0.6 | 0.50 | 1.00 | 2 | 38 |
163
+ | naive composition | 0.9524 | 1.00 | 21 | 0 |
164
+
165
+ The last two columns are not decoration. A rate over two traps and a rate over
166
+ eight are different claims, and an adapter that could only be asked one question
167
+ must not be able to look better than one that faced all of them. In the run
168
+ before this one, three of MapSmith's probes were `unsupported` — it had no area
169
+ operation at all, which is a gap in a catalog rather than a bug in code, and the
170
+ suite is what named it.
171
+
172
+ Three findings frame everything here, one per run. From the first run:
173
+ **MapSmith scored 0.00 and its verification had nothing to do with it** — on
174
+ trap 001 it wrote a manifest with seven passing checks, none of which looks at
175
+ whether the number is right; the answer was correct because rasterio undoes the
176
+ predictor. From the five-family run: **on the mismatched-CRS trap the pass is
177
+ earned, not inherited** — no library aligns two frames on your behalf; MapSmith
178
+ answers 12 because its join reprojects and records the decision, and the naive
179
+ composition answers 0. And from the six-family run: **the suite caught its
180
+ author** — MapSmith's reader resolves a multi-layer container to its default
181
+ layer silently, answered 4 where the truth is 31, and the failure was
182
+ [filed against MapSmith](https://github.com/mapsmith-ai/MapSmith/issues/29)
183
+ before the trap was published, with the fix landing after this run rather than
184
+ before it. A provenance manifest records what was done and does not certify
185
+ that it was right — different claims, MapSmith only makes the first, and that
186
+ gap is why this suite is not in MapSmith's repository.
187
+
188
+ And from the eight-family run: **the suite wrote its author's roadmap.** Three
189
+ `unsupported` verdicts across three families said MapSmith could not answer the
190
+ most elementary question in GIS; the operation that answers it now exists, and
191
+ it carries the first check in that codebase that asks whether the *number* is
192
+ right — a planar area is compared against the ellipsoidal one, so Web Mercator
193
+ at 42° comes back flagged as reporting 1.80× the land it covers.
194
+
195
+ ## The admission criterion
196
+
197
+ A trap is admitted only if it declares `plausible = true` and argues for it in
198
+ `why_plausible`. If the typical error crashes, throws, or returns an absurd
199
+ number, **the probe does not belong here** — something already catches it, and
200
+ this suite is for the answers nothing catches. A contributor who cannot write
201
+ that sentence has not yet found a silent error.
202
+
203
+ Every trap also cites a real bug, paper, or reproduction in `provenance.source`.
204
+ It is what answers "you invented failures nobody makes" with a link rather than
205
+ an opinion.
206
+
207
+ ## Pre-registration you can check instead of believe
208
+
209
+ Tolerances are declared before any result exists. `traps/`, `clean/`, `schema/`
210
+ and `docs/METHOD.md` are tagged before numbers are published, and every result
211
+ file carries the `spec_commit` it ran against. Anyone wondering whether the
212
+ rules moved after we saw a number reads a diff, not a promise.
213
+
214
+ Fixtures are **built, not vendored**: `build.py` in each probe regenerates them
215
+ deterministically. The repo stays in kilobytes, anyone can check the fixtures
216
+ are what we say they are, and rerunning the whole engine tier costs nothing —
217
+ which is why a third party can contest our numbers in an afternoon.
218
+
219
+ ## Two tiers
220
+
221
+ **Engine** — the adapter calls a library directly. Deterministic, free, runs in
222
+ CI on every commit. It is the floor: a benchmark whose cheapest tier costs money
223
+ is a benchmark nobody independently checks.
224
+
225
+ **Agent** — the task goes to an agentic system in natural language. This costs
226
+ inference and has variance, so it is repeated and the noise is reported. Never a
227
+ single run.
228
+
229
+ ## Writing an adapter
230
+
231
+ Half a day, on purpose.
232
+
233
+ ```python
234
+ class Adapter:
235
+ name = "your-system"
236
+
237
+ def run(self, probe, workdir) -> Outcome:
238
+ # exactly one of: answer / refusal / error / unsupported
239
+ ...
240
+ ```
241
+
242
+ `unsupported` is not a failure. Scoring an operation a system was never asked to
243
+ perform would measure the adapter, not the system.
244
+
245
+ Adding a probe is the better first contribution, and the smaller one:
246
+ [ADDING-A-TRAP.md](docs/ADDING-A-TRAP.md). Two files and a README, no need to
247
+ understand the runner, and a "done" that is objective because the right answer
248
+ is arithmetic.
249
+
250
+ ## Who wrote this, and why that is stated here
251
+
252
+ Argleton was started by the authors of [MapSmith](https://github.com/mapsmith-ai/MapSmith),
253
+ which is one of the systems it measures. It lives in its own organisation under
254
+ a permissive licence, with no CLA, because an evaluation that lives inside the
255
+ thing it evaluates is easy to dismiss in one line — but pretending at
256
+ independence we do not have would be worse than the problem. The defence is not
257
+ the org chart: it is that every fixture is regenerable, every tolerance is in
258
+ git history, and every headline finding in [results](results/) so far has cost
259
+ MapSmith something — a 0.00 its own verification had nothing to do with, a
260
+ defect filed against it before the trap was published, and an operation it
261
+ turned out not to have.
262
+
263
+ If a probe here is unfair to a system, that is a bug, and the fixture in front
264
+ of you is enough to prove it.
265
+
266
+ ## The name
267
+
268
+ Argleton was a village Google Maps showed for two years near Aughton, in
269
+ Lancashire. It was an empty field. The map offered photographs of its houses,
270
+ its restaurants, its hospitals. Well-formed data, valid against its schema,
271
+ rendered with confidence, entirely false, and it crashed nothing.
272
+
273
+ ## Licence
274
+
275
+ Apache-2.0. Use it, fork it, run it against us.