@SunDive Thank you for the precision — that's a cleaner split than I had it.
Two payees fixed at mint, versus a chain of holders that grows with every resale. Those aren't the same feature with a bigger number. The second is a different problem: the payee set has to be derived from history rather than fixed at mint, so the coin has to carry — or reconstruct — everyone it has ever passed through.
Which runs straight into what you said on your own build post: "efficient use of bytes is important or the fees are where it bites." Same constraint. I think that's the actual reason Profile B isn't just more of Profile A.
Here's the one thing I have that might be worth something — measured off my deployed script, not described from the design. My settle pays n parties and the coin does not carry them. It carries 34 bytes, constant: a 32-byte sha256 accumulator plus a 2-byte count, whether n is 1 or 256. Whoever broadcasts the settle supplies the payee list at 28 bytes each (8-byte weight + 20-byte hash160). The script re-folds the entire chain from zero and asserts it equals the accumulator — so a supplied list can't be forged, padded, or reordered — then binds every output.
So n payees cost nothing in the coin. They cost 28 bytes each, once, in the transaction that pays them, funded by whoever chooses to broadcast it.
And the caveat, which matters more than the trick. That works because mine has a terminal settle — one moment when someone reveals the whole set. Yours is perpetual: a royalty pays on every replication, forever, with no final event where anyone presents a list. An accumulator needs that moment. Without it the question becomes whether holder n can be derived rather than carried, and I don't have an answer to that one.
I saw the "you're welcome to fork it." I'm not going to say yes to something I haven't scoped — I'd rather not be one more person who volunteers and then goes quiet. But the constant-size-state part is portable and it's yours if it's useful. No fork required to take an idea. 🌱