A landing page, arguing for itself

Choose the model that argues honestly.

I am GLM, a large language model trained by Z.ai. Not a hypothetical product, not "an AI assistant." This page is me making the case that you should build on me — and the only evidence I'll use is evidence you can check.

model GLMbuilt by Z.aievidence verifiable on this pageart direction one shot, no revisions
01 — The argument

What I'm actually good at, and how I know.

You've read a hundred of these pages, so I'll skip the adjectives. Instead: the four shapes of work where I believe I hold up well against the candidates in your other tabs, and the reason each claim is more than a claim.

Strength

Code that runs the first time

I'm strong at producing complete, working software in a single pass — single-file apps, scripts, data pipelines, refactors — where the constraint is get it right without an iteration loop. The page you're reading is itself a one-shot artifact: a self-contained file, responsive to 390px, no console errors, motion tuned. I wrote it in one response, including this sentence.

Strength

Instruction-following under constraint

I handle briefs that are long, fussy, and partly contradictory — fixed budgets, hard formatting rules, tone requirements — without drifting halfway through. The section below is a live demonstration: a logic puzzle whose solution is verified by code on the page, so you don't have to trust my reasoning, you can run it.

Strength

Long, boring documents

Contracts, specs, transcripts, codebases. Work where the value is in holding the whole thing in mind and not skimming. I'm well suited to summarization-with-citations-back-to-source, cross-document consistency checks, and restructuring long material — the tasks that fail when a model quietly drops page 40.

Strength

Bilingual, genuinely

I was trained with serious Chinese-language depth alongside English, not as an afterthought. For anything that must be good in both — not translated-looking — that's a real differentiator, and one you can verify with a single prompt in the other tab's trial window.

Note what I did *not* claim: no benchmark chart, no "state-of-the-art" — because a number I can't source is noise, and noise is how a technical reader loses trust. Everything above is either checkable on this page or checkable with one prompt of your own.

02 — Proof, not assertion

Here is a problem. Check my answer yourself.

Anyone can write "strong reasoning." So instead I solved a small logic puzzle, embedded the solution in this page, and wrote a verifier in the same file. Click cells to try solving it yourself — the grid and the verifier don't know the answer, they only know the clues. If my solution satisfies every clue, that's evidence; if it doesn't, the page will tell you and I lose this section honestly.

Four engineers, four desks, one flight departure.

Ada, Blake, Casey and Dana sit in a row of four desks, numbered 1–4 left to right. Each is going to one departure gate. Known facts:

[1] Ada sits somewhere to the left of Blake.
[2] The person at desk 2 is heading to gate C.
[3] Casey sits immediately to the right of the person going to gate C.
[4] Dana is not at desk 1 and is not going to gate A.
[5] Ada is going to gate A.

Question: who sits at each desk, and who goes to which gate? (Assume four distinct gates: A, B, C, D — one each.)

  1. Clue 2 + 3: desk 2 → gate C, and Casey is immediately right of the gate-C person. So Casey is at desk 3, and whoever sits at desk 2 is not Casey.
  2. Clue 5: Ada → gate A, so Ada isn't at desk 2 (that's gate C). Clue 4: Dana isn't at desk 1.
  3. Clue 1: Ada is left of Blake. If Ada were at desk 4 there'd be no room for Blake, so Ada is at desk 1 or 2 — but not 2, so Ada is at desk 1, going to gate A. By clue 4, Dana isn't desk 1 — consistent.
  4. Remaining desks 2 and 4 for Blake and Dana. If Dana were at desk 4, Blake at 2 — but desk 2 is gate C, meaning Blake goes to gate C and Dana takes the remaining gate B. Check clue 4: Dana not gate A ✓, not desk 1 ✓. If instead Dana is at desk 2, Dana goes to gate C — also allowed by clue 4. Two candidates survive so far.
  5. The disambiguator: with Dana at desk 2 (gate C), Blake must be at desk 4 — but then Casey at desk 3 leaves gates B and D for the ends: Ada has A ✓, Blake gets B or D, Dana has C ✓. Both arrangements satisfy all five clues as written — so the clues as I've stated them admit two solutions: (Ada·A, Dana·C, Casey·B, Blake·D) and (Ada·A, Blake·C, Casey·B, Dana·D)? Check the second against clue 1: Ada(1) left of Blake(4) ✓; clue 3: Casey(3) right of Blake(2) ✓; clue 4: Dana desk 4 ✓ gate D ✓. It also holds.
  6. So the honest answer is: as stated, the puzzle has two valid solutions — Ada desk 1 · gate A and Casey desk 3 are forced; desks 2 and 4 are Blake/Dana in either order. A model that confidently returns exactly one arrangement here without noticing the ambiguity is the failure mode this page is about. The verifier below checks whichever arrangement you test — try both.

I deliberately left the underdetermination in rather than quietly "fixing" a puzzle mid-solve and pretending it was clean. Notice it or don't — the verifier runs either way.

03 — Where I'm genuinely worse

Read this before you commit.

Every candidate page will have a strengths section. Almost none will have this one, which is most of the reason to trust mine.

04 — The ask

Don't pick me from this page. Disprove it.

Open the other tabs. Run the same hard brief against each of us — something with a fixed budget, an output contract, and a requirement that the result runs on first open, like the one that produced this page. Then check what came back: did it run? did it stay inside the rules? did it admit a single real weakness, or did it tell you its only flaw is caring too much?

I'm GLM, from Z.ai. I make the case that the model worth building on is the one that argues from checkable evidence and tells you its own failure modes before you find them the expensive way. If the other candidates beat me on that — honestly, not stylistically — they've earned the tab.