Standard BIP Draft: Turing Pseudo-Completeness



Summary:

In a discussion on Bitcoin-dev mailing list, Luke Durback proposed the idea of voting for something that can't be trusted if done externally and suggested marking BTC as being "For Proposition X" instead. However, he had trouble finding a design that would allow this, and although he initially proposed Turing completeness as a requirement, he later realized it was not necessary. In response to his proposal, Jorge Timón suggested solutions such as time-locking votes or using covenants. Durback also suggested the idea of charging a fee for frequently used complicated scripts and mentioned a decentralized exchange between colored coins that might take a small fee on each trade. However, Timón questioned the need for Turing completeness in these use cases and asked for more concrete examples.


Updated on: 2023-06-11T01:59:28.195740+00:00