I need more eyes/help on this. We're trying to build a proof of liabilities scheme for cashu mints. Heavily inspired by @calle original ecash pol (https://gist.github.com/callebtc/ed5228d1d8cbaade0104db5d1cf63939), but using with sum-MMRs for issued and spent notes instead of simple lists. And "anchoring" the root of the tree onchain using @Peter Todd 's OpenTimestamps.
The goal is not to punish the Mint for misbehaving (slashing is impossible) but simply being able to challenge them publicly on their solvency claims.
Anyway here is the spec:
In case bip110 results in a chainsplit, we've designed a tool that will let you sell off the coins on the chain you don't like, for more coins on the side you consider valuable. Atomically. On-chain. Re-play protected.
This is a regtest demo: on the left an initiator splitting their coins and publishing an offer to sell B110, on the right side an acceptor that wants to sell BTC:
Repository:
All AI companies have all at once decided to completely CUCK their models ability to do security scanning. This obviously won't deter malicious actors, and only hurts builders and OSS developers because we're not able to do defensive scanning anymore.
(or at least until the next jailbreak is discovered, which hackers get first ironically)