nx_commons_sybilcost_gate.nx

nx_commons_sybilcost_gate.nx -- measures the sybil bound instead of asserting it. The claim under test is the trust-flow theorem: total standing reachable by an attacker depends on ATTACK EDGES, not on the number of identities minted. T2 is the tooth -- multiply the sybils by 1000 with the attack edges held fixed, and the attacker's total must not move by one unit. T1 bite-proves it against the naive vouch-counting rule kept as a negative control, which grows linearly with identities and is therefore farmable for free. license_tier: ORIGINAL expect_exit: 0