docs/pm_operator_v0.md

PM Operator v0

Clean product one-liner: the PM operator is one thin desk that turns reduced user data into product candidates, chooses the next bounded slice, and only promotes through receipts and benchmark gates.

What it owns

Surface	Why
product candidate registry	turns user-data reductions into possible product slices
continuity state	recovers the live product position
benchmark gate	proves the shell is still correct

Commands

Command	Job
./bin/bvtctl pm-products	inspect candidate products
./bin/bvtctl pm-resume	load the PM desk packet
./bin/bvtctl pm-next	get the next bounded delivery move
./bin/bvtctl pm-verify	inspect the benchmark gate

Delivery law

candidate -> active surface -> bounded move -> benchmark -> promotion

Why in plain English

This keeps product delivery small and governable.

The PM operator should not reinvent memory, and it should not ship from vibes.

It should:

1. find likely product slices from retained user data
2. resume the current live state
3. choose one bounded next move
4. require proof before promotion