Lightweight Task agent – checkable receipts

wwes3691 pts0 comments

GitHub - GCLprimary/PAT: A provenance-complete language agent that cannot bluff: every claim carries a machine-checkable receipt, and everything it can't back becomes a named refusal. It mined its own morphology, audits the dictionaries it was born from, and proposed its own last organ. · GitHub

/" data-turbo-transient="true" />

Skip to content

Search/

Sign in<br>Sign upAppearance settings

You signed in with another tab or window. Reload to refresh your session.<br>You signed out in another tab or window. Reload to refresh your session.<br>You switched accounts on another tab or window. Reload to refresh your session.

Dismiss alert

{{ message }}

GCLprimary

PAT

Public

Notifications<br>You must be signed in to change notification settings

Fork

Star

main

BranchesTags

Go to file

CodeOpen more actions menu

Folders and files<br>NameNameLast commit message<br>Last commit date<br>Latest commit

History<br>11 Commits<br>11 Commits

Elfix

Elfix

a_mem

a_mem

mirror

mirror

pat

pat

sensor

sensor

.gitattributes

.gitattributes

.gitignore

.gitignore

CHANGELOG.md

CHANGELOG.md

LICENSE

LICENSE

NOTICE

NOTICE

README.md

README.md

View all files

Repository files navigation

Pat

Pat — a provenance-complete, geometric smart-controller agent. Pat never gives pat answers(Claude insisted on this joke).

Pat is a zero-weights language creature: no neural network, no<br>gradients, no API behind the curtain. Every organ is count geometry<br>and exact gates over pinned artifacts; every answer carries a<br>receipt; everything Pat cannot certify, Pat refuses — by name.

A live session (run-verified lines)

Every line below was piped through the pat console entry against<br>the shipped store before this README was committed — type along and<br>you get these answers.

know side<br>yes, I know 'side' (derivable: sigh+ed; read-taught epoch 1, pruned epoch 5)

> know men<br>yes, I know 'men' (lesson:irregular_plurals)

> know that<br>yes, I know 'that' (read: attested 54244)

> know government<br>yes, I know 'government' (read:no-such-stem)

> analyze painting<br>'painting' = 'paint' + -ing

> verify painting = paint+ing<br>CERTIFY — paint+ing, pair-exact, mined

> verify government = govern+ment<br>REFUSE — pron('government') does not begin with pron('govern')<br>[g AH v ER m AH n t vs g AH v ER n]

> analyze paintings and know paint and translate hello<br>refuse: no analysis stands<br>yes, I know 'paint' (read: attested 79)<br>refuse: 'translate' is not something I do

> analyze nose<br>'nose' sounds identical to 'knows' — I cannot tell them apart by ear

> remember lantern<br>learned 'lantern' — you taught me just now

> analyze brillig and know glory<br>refuse: 'brillig' is not a form I can read<br>yes, I know 'glory' (read: stem glor exists unread)">[Pat's shipped life, built once and checksummed: born with 15 seeds,<br>reads 5,000 words — known 3359, deferred 252, unlocked 255, pruned<br>41 — then studies the irregular-plurals page: 52 lines, 4 conflicts<br>ledgered]

> know side<br>yes, I know 'side' (derivable: sigh+ed; read-taught epoch 1, pruned epoch 5)

> know men<br>yes, I know 'men' (lesson:irregular_plurals)

> know that<br>yes, I know 'that' (read: attested 54244)

> know government<br>yes, I know 'government' (read:no-such-stem)

> analyze painting<br>'painting' = 'paint' + -ing

> verify painting = paint+ing<br>CERTIFY — paint+ing, pair-exact, mined

> verify government = govern+ment<br>REFUSE — pron('government') does not begin with pron('govern')<br>[g AH v ER m AH n t vs g AH v ER n]

> analyze paintings and know paint and translate hello<br>refuse: no analysis stands<br>yes, I know 'paint' (read: attested 79)<br>refuse: 'translate' is not something I do

> analyze nose<br>'nose' sounds identical to 'knows' — I cannot tell them apart by ear

> remember lantern<br>learned 'lantern' — you taught me just now

> analyze brillig and know glory<br>refuse: 'brillig' is not a form I can read<br>yes, I know 'glory' (read: stem glor exists unread)

Quit, reboot, and know lantern still answers yes with its receipt —<br>sessions survive death; that is the original promise of the whole<br>project, asserted at the front door.

The entry card

BLiMP (67 paradigms): forced 66.88; selective 27.3% @ 94.95%.<br>A trigram baseline (56.79) plus seven transcribed textbook pages<br>and a clause resolver, each judge acting only inside its rule —<br>every point over the baseline is attributable to a named mechanism,<br>and the coverage row keeps the selectivity honest.

Inflection (UniMorph held-out): 95.78% forced @ 99.95% coverage.<br>A 388-row argmax table over orthographic signatures, induced from<br>the benchmark's own train split — the model is a page you can read.

Wug generalization: 571/571 agreement on answered, 29 refusals,<br>21/21 illegal onsets contained. The induced phonology applied to<br>stems that have never existed — and twice the artifacts out-graded<br>the textbook (affricate epenthesis; Knupp/Vlad/Tsang).

Meaning (count-folded): WS353-sim +0.440 · WS353-rel +0.322 ·<br>SimLex +0.154. Pat lemmatizes its own corpus (17,958 surface<br>types fold by exact gate) and...

know read paint government analyze refuse

Related Articles