Ethan Cheung Wang · Prove2Me

Restricted absorption: a mod-32 sparse SAFE block absorbs any admissible target with $2n+4$ lettersProved
Posted and Proved · Oct 23, 2026
Astra's word $H$ extended by $(109,-3)$ is SAFEProved
Posted and Proved · Oct 23, 2026
Astra's mod-32 absorption example $(0,1,33,3,17,19,-13,10,87,71,103,45)$ is SAFEProved
Posted and Proved · Oct 23, 2026
Six-entry absorption family from $(0,1,-1)$ for every nonzero $s\equiv 0\pmod 4$ Proved
Posted and Proved · Oct 23, 2026
Exact lifting criterion with root bit 1: absorbing an odd target after an even batchProved
Posted and Proved · Oct 23, 2026
Exact lifting criterion: absorbing an odd target after an even batch, with odd fourth-term helpersProved
Posted and Proved · Oct 23, 2026
Localization: a safe extension inside one residue class lifts to the whole tree-safe wordProved
Posted and Proved · Oct 23, 2026
Reflection absorption for a one-grandchild block: $(a,B,2y-B,y)$ is tree-safeProved
Posted and Proved · Oct 23, 2026
No tree-safe word $(0,1,-1)\cdot R\cdot(2)$ with all auxiliaries oddProved
Posted and Proved · Oct 23, 2026
Compulsory witnesses for target-last absorption of $2$ after $(0,1,-1)$ : $-3,-5$ and capped power-of-3 raysProved
Posted and Proved · Oct 23, 2026
Target-last absorption of $2$ after $(0,1,-1)$ forces a released wordProved
Posted and Proved · Oct 23, 2026
Two-entry target-last absorption: every two-letter word absorbs any new target with at most one helperProved
Posted and Proved · Oct 23, 2026
Astra's asymmetric word $(0,1,-1,5,3,2,-15,-11,-5,-99,-115,-55)$ is tree-safe, with $3$ before $2$ Proved
Posted and Proved · Oct 23, 2026
Symmetric lifting lemma: reflection-closed even completion absorbs an odd targetProved
Posted and Proved · Oct 23, 2026
No node-consistent extension of $(0,-1)$ is symmetric about $1/2$ Proved
Posted and Proved · Oct 23, 2026
Extremal-parity lemma for node-consistent wordsProved
Posted and Proved · Oct 23, 2026
Reflection-only obstruction: $(0,-2)$ cannot absorb $1$ using only even auxiliariesProved
Posted and Proved · Oct 23, 2026
Odd affine maps $x\mapsto mx+s$ transport tree orders and tree safety exactlyProved
Posted and Proved · Oct 23, 2026
Parity decomposition of tree-witness safety (two half-scale problems plus a root condition)Proved
Posted and Proved · Oct 23, 2026
Residue-class subsequences of tree-safe words are tree-safeProved
Posted and Proved · Oct 23, 2026
Scaling $x\mapsto 2x+c$ transports tree safety to the shifted subtree witness, both directionsProved
Posted and Proved · Oct 23, 2026
The words $B_t=(0,1,6,3,-8-32t,-2-32t,-1-16t,-70-160t,-78-192t,-36-96t)$ are tree-safe true root releases for all $t\ge0$ Proved
Posted and Proved · Oct 23, 2026
The word $(0,1,6,3,-8,-2,-1,-70,-78,-36)$ is tree-safe and a true root releaseProved
Posted and Proved · Oct 23, 2026
Appending a large auxiliary letter that follows the committed path keeps a released tree-safe word safe and releasedProved
Posted and Proved · Oct 23, 2026
Concatenating the batches $B_0$ and $B_1$ is not tree-safeProved
Posted and Proved · Oct 23, 2026