Public vs Hidden (Current Direct-Spend Path)¶
This table summarizes the current bounded two-input direct-spend visibility boundary.
| Surface | Current status | Notes |
|---|---|---|
| Recipient confidential payload semantics | Hidden, proof-bound in bounded two-input scope | Bounded TRQ1 sink semantics are proof-bound for current milestone scope. |
| Sender hidden private change semantics | Hidden, proof-bound in bounded two-input scope | Bound to committed-value sink semantics in current bounded lane. |
| Continuation reserve semantics | Hidden, proof-bound in bounded two-input scope | Bound in bounded two-input relation/runtime path. |
Source-side hidden conservation (input0 + input1 = sinks + fee) |
Hidden, proof-bound in bounded two-input scope | Not an arbitrary-N claim. |
| PIv1/PBV1 carrier bytes | Public | Required verifier/runtime boundary surface. |
Proof carrier presence (txHasProof, txHasPbv1) |
Public/assertable | Runtime/tx/evidence boundary remains explicitly checkable. |
| Continuation shell sats | Public | Transport continuity surface, not confidential payload value. |
| Miner fee sats | Public | BCH L1 settlement constraint. |
| Supplemental transparent economics support (if used) | Public | Interim economics support path; distinct from protocol authority. |
| Settlement graph/topology | Public | Not solved by direct-spend bounded milestone. |
| Repeated no-top-up sustainability | Not yet solved as sustained normal path | Currently reserve-limited. |
Claim boundary reminder¶
- Do not treat bounded two-input proof enforcement as arbitrary-N generalized coverage.
- Do not claim whole-system fully zero-knowledge from direct-spend alone.
- Aggregator-layer observability reduction remains future work.