We have now completely withdrawn from the BSV blockchain. We sincerely thank all our supporters for their enthusiasm and long-standing support. At the right time, we will relaunch the ideas behind the NOTE protocol on NoteChain. Please continue to follow and support us.

We will shut down NOTE.SV version 2.0 by February. The NOTE.SV 1.0 version, which started in 2020, was open-sourced last year and can still be freely used by anyone.

We’ve created the @aidebate_xyz project: a cohort of AI agents simulating investing maestros like Buffett, Cathie Wood, and others. Each agent has its own investment philosophy, personality, and research toolkit—and, crucially, its own memory. They then open a group chat to debate a single stock. You type: “Can we still buy Apple? Its AI investments are clearly falling behind.” How do you think the masters would discuss this? #multiagent

NOTE.SV v1 code has been open-sourced. This version was completed in 2020 and uses the #BSV blockchain to store, share, and manage secure notes and website passwords. It is intended solely for learning and research related to the NOTE protocol @NoteProtocol , as well as for recovering notes. github.com/Note-sv/NOTE.SV github.com/Note-sv/Protocol

NOTE.SV v1 will open source its code today. Salute to those who still persist on BSV, and to those who hope NOTE.SV can support Teranode in the future.

Using Scrypt in Offchain @scryptplatform

Actually, this feature is already available, but our UI design fails to highlight it. We will further upgrade it after July.

Turing completeness & Halting Problem If we say the native Bitcoin scripting language is Turing complete, many people will criticize us. #TuringCompleteness refers to a programming language that can implement any computation a Turing machine is capable of. This concept comes from Alan #Turing, who proposed the #TuringMachine model. It’s an abstract machine that performs calculations by reading and writing symbols on an infinitely long tape. If a programming language is Turing complete, it means it can simulate all computational functions of a Turing machine. Typically, this requires the language to support conditional branching (like if/else statements) and loops (or recursion) to make decisions based on data and repeatedly perform certain actions until a specific condition is met. Is it reasonable that a program in an infinite loop could run indefinitely on an infinitely long tape? Is it reasonable to say that a program that can implement an infinite loop is Turing complete? In fact, simple infinite loops can be implemented with a very basic set of instructions, but if there's insufficient control structure (like conditional branches) and data handling capabilities, such systems cannot be considered Turing complete. Turing completeness requires the ability to express any complex algorithmic logic, including but not limited to loop structures. Furthermore, infinite loops introduce another issue: the Halting Problem. The #HaltingProblem, proposed by Alan Turing in the 1930s, is a well-known problem in computation theory. It explores whether there exists an algorithm that can determine whether any given program and its input will eventually stop executing. Turing proved the Halting Problem is unsolvable. Turing-complete systems can express and execute all possible programs, including those that never halt. The unsolvability of the Halting Problem arises directly from the capabilities of these systems. In short, the robust computational power of Turing-complete systems introduces uncertainty because we cannot predict in advance whether a program will stop in all cases. Now let’s see why some claim Bitcoin's script is not Turing complete. Because it lacks loop commands in its opcode, some argue it's not Turing complete. However, assembly language also lacks loop commands, yet no one disputes its Turing completeness. Assembly language provides the necessary tools to implement loops primarily through conditional jump instructions. Bitcoin script is similar to assembly in that loops can be unrolled. For example, to sum from 1 to 100, you could keep adding: 1+2=3, 3+3=6, 6+4=10, and so on until 100. This approach has a benefit—it addresses the Halting Problem. We know that Bitcoin transactions and blocks are limited in size, from 1MB to 4MB, potentially larger. Therefore, an unrolled script will eventually hit this size limit and force the program to stop. One might say: Bitcoin script language is Turing complete and also solves the Halting Problem. In Ethereum, the Halting Problem is addressed by charging a fee (gas) for each operation. Theoretically, a wealthy Ethereum user could pay to run a program for a year, potentially clogging the EVM. However, on #Bitcoin , no amount of money can infinitely increase block size, ensuring programs must stop. This is part of the consensus. In the computing field, there’s an important principle: the KISS principle (Keep It Simple, Stupid). #Satoshi #Nakamoto adhered to this principle. Maintaining simplicity in a system is a crucial consideration for designers. In environments like @NoteProtocol, script size is still controlled, currently providing about 2.5K of script JSON storage space. In the future, it could expand to between 1MB and 4MB. Follow me to learn about #BitcoinPrinciples and the advanced Bitcoin scripting language at @scryptplatform for @NoteProtocol

You can use the ChainBow Wallet @ChainBow_io to import the same mnemonic phrase. When importing, select 'Advanced' and then choose 'NOTESV' to restore BSV balances – at Chiyoda-ku, Tokyo

We are working on a new version of the ChainBow Wallet, v3 @ChainBow_io , which offers improved support for $BSV, $RXD, $BTC, and @NoteProtocol for tokens and NFTs. It will also support payments with the new NOTE.SV v2. The NOTE protocol serves as the underlying data protocol for NOTE.SV and outlines how notes are encrypted. This new protocol differs from NOTESV v1.0. We do not recommend continuing to use NOTESV v1.0 for two reasons: firstly, the new protocol offers enhanced features, and secondly, there is a risk that BSV will not be viable following CSW’s failure. BSV faces significant issues with its economic model, and its ecological sustainability is questionable. – at Chiyoda-ku, Tokyo

⚠️ Addressing your feedback on NOTE.SV: Firstly, all password notes are encrypted within the app, and the same encrypted content is securely saved in NOTE Cloud as well as on the BSV and RXD blockchains. Rest assured, NOTE Cloud is secure with no plaintext content stored. Secondly, we are planning to introduce a subscription service. Only subscribers will have the ability to sign transactions using their own wallets, with digital currencies serving as transaction fees. like $RXD $BSV $BTC Furthermore, the absence of digital currencies in the app stems from our goal to cater to everyday people, most of whom may not possess wallets or blockchain expertise. NOTE.SV is a real blockchain application designed not just for the crypto-savvy but for general use. If you're not interested in the paid blockchain features, this app provides powerful encryption capabilities for free. It's not only suitable for storing information, but also ideal for sharing encrypted content with family and business partners. – at Adachi-ku, Tokyo

You can use the ChainBow Wallet @ChainBow_io to import the same mnemonic phrase. When importing, select 'Advanced' and then choose 'NOTESV'.

Choose account/settings/import, it supports import from csv file of others software

We advise against anchoring unencrypted information on the blockchain. Restrictions have been implemented, such as a 78-byte limit, because once data is anchored, it cannot be modified and remains permanently visible to everyone. This can pose social issues as the content is indelible and publicly accessible. – at Chiyoda-ku, Tokyo