Oliver Zhang · London / Suzhou / Shenzhen · Off duty, chess.
Keep goals reachable, make unsafe states unreachable, and prune invalid paths after verification.
裁决先于相信,阈值先于数据。
| Project | PR | Verdict & Scope |
|---|---|---|
tile-ai/tilelang |
#3045 |
Official compile-only CLI: python -m tilelang.tools.compile_only lowers kernels to source without executing them. |
compiler-explorer/compiler-explorer |
#9029 |
Integrated TileLang as a compile-only language in Compiler Explorer. |
compiler-explorer/compiler-explorer |
#9210 |
Single regex parsing binary asm source lines in objdump output across Linux, Windows, and llvm-objdump. |
compiler-explorer/infra |
#2307 #2381 |
TileLang 0.1.13 and 0.1.14 pip packages. |
The-Last-Math-Competition |
#920 |
Disproved Conjecture 00000000408: for n = 2, Kronecker coefficient g((2,1),(2,1),(2,1)) = 1 is odd while 2 is not triangular. Lean 4.19 proof (0 sorry, no native_decide, no extra axioms). |
| caging-engineering | An agent is not a mind to instruct but a space to shape. The cage is not a wall around it; it is the geometry of what can happen next. Goals stay reachable, unsafe states become unreachable, and paths that failed are pruned after the fact rather than forbidden in advance. Freedom is what remains once the boundary is drawn. |
|
| Terra | Caging taken literally, as a runtime. Nothing the model wants happens until it has passed through something that cannot be persuaded. Memory has owners and levels, because knowledge anyone may overwrite is not knowledge. Every action leaves a trace that outlives the conversation. Efficiency is intelligence. |
|
| AIOps | The gate belongs to the repository, not to whoever is pushing. Forge decides who may touch a protected branch; Overlay turns requirements into tests that can be read before they are run. Machines may propose, review and fail loudly. Only a person merges. Fail closed. Never self-merge. |
|
| OfficeX | The intelligent part finishes thinking; this is the part that makes the document true. It does not try to be clever. It executes exactly, then looks at the result three ways: as structure, as a page, as meaning. Errors invisible in text are made visible before anyone reads. Correctness is not an opinion the model holds. |
|
| microfluidic-native-physics | Hold out an entire chemistry, seal the labels, and let the model fail in public. The negative result stays in the record, because a record that remembers only success is not a record. Every claim arrives with a table of what it is not allowed to mean. Thresholds before data. Negative results stay. |
|
| world-cellular-automata | The world as a state that rewrites itself. Each node opens into a local world, evolves by pairwise interaction, and collapses back into the next state. The baseline is protected, the evaluation is strict, and the report is archived where it cannot be quietly revised. A prediction is a claim about the next state, nothing more. |
|
| bsaa-gaokao-theory | Choosing under admission uncertainty, treated as a submodular problem. The theory lives in a repository of its own so the mathematics can be judged apart from the product. What the greedy rule guarantees is proved, and the proof is re-checked by a kernel that cannot be flattered. Proved, then checked by something that does not argue. |
|
| robot-pm | A project assistant that does less than it could. It checks what exists before it creates anything, prints the name of what is missing and never its value, and calls no meeting without the group's consent. Time is Beijing time. Consent before action. Presence before creation. |
|
| 100-journeys | A hundred doors, each opening on its own hour. The one project here that is about how a thing feels, made with the same care as the ones about whether it holds. the door opens in its own shape; open doors keep their light. |



