The Privacy Pools manuscript asks whether someone can demonstrate a limited claim about the origin of funds without publishing the entire transaction history. Its proposal uses zero-knowledge proofs of membership in custom association sets. A withdrawal can demonstrate that its deposit is among an accepted group, or outside an excluded group, without identifying the exact originating deposit.

The paper explores an equilibrium in which users can distinguish themselves through these proofs. That is a design argument with assumptions about set construction, counterparties and incentives. It is not a court ruling or evidence that every institution accepts such proofs. Read the association-set rules and practical considerations alongside the cryptography. A correct proof establishes membership in the specified set; whether that set captures a meaningful policy is a separate question.

The 0xbow documentation describes asset-specific pools, commitment and withdrawal circuits, and an Association Set Provider that maintains approved deposit labels. It also describes partial withdrawals and a public exit mechanism, called ragequit, for original depositors whose deposits are not approved. Those details belong to this implementation and should not be silently attributed to every protocol using the general privacy-pool idea.

The documentation's compliance language describes a product objective. A more precise technical reading asks which entity updates the association set, which accounts have that permission, what evidence informs inclusion and how a user exits after rejection. Public exit can preserve access to funds while changing the privacy outcome. Therefore, the availability of an exit and the ability to exit privately should be recorded as different properties.

Suppose a fictional pool contains 100 deposits and a recipient accepts proofs against a set containing 80 of them. A valid proof may establish that a withdrawal originated among those 80. It does not reveal which one, but the 80 deposits are only a starting anonymity set. If only one has a distinctive amount or timing compatible with external observations, practical uncertainty may be much smaller. These numbers illustrate reasoning, not measured pool privacy.

Now let two counterparties require different association sets. Repeated disclosures may reveal membership in their intersection. Draw overlapping circles and count the remaining candidates before calling the result anonymous. Also ask how a mistaken exclusion is challenged and whether an update changes the treatment of an earlier deposit. Set governance and user experience can materially affect the privacy that the proof system makes possible.

The 2023 SeDe arXiv preprint proposes a different approach: selective de-anonymization involving multiple entities, threshold encryption and zero-knowledge proofs. Its research question is how to distribute authority over revealing illicit transaction links rather than leave that control with one party. The proposal helps expose an important design choice: proving a restricted statement and authorizing disclosure of a hidden graph are different capabilities.

For either approach, build a threat model naming the user, set provider or disclosure authorities, observer and counterparty. Ask what each party can learn alone and through cooperation. Look for a formal security statement, implementation evidence and a precise account of false positives and appeals. Neither a preprint nor a successful proof substitutes for jurisdiction-specific legal analysis; this comparison concerns technical disclosure boundaries rather than a claim of universal regulatory approval.