Binance HODLer airdrop launched Solayer (LAYER); Binance Alpha listed Autonolas (OLAS); DIN launched the airdrop query page and announced the token economics.Binance HODLer airdrop launched Solayer (LAYER); Binance Alpha listed Autonolas (OLAS); DIN launched the airdrop query page and announced the token economics.

PA Daily | DIN launches airdrop query page and announces token economics; CEXs such as Binance and Upbit will list Solayer

2025/02/11 17:30

Today's news tips:

Japanese gaming company Gumi announces purchase of $6.6 million in Bitcoin and plans to participate in BTC staking

SEC and Binance jointly apply for a 60-day suspension of litigation, possibly affected by the new crypto regulatory task force

NYSE Arca files for Cardano ETF for Grayscale

North Carolina proposes to invest in Bitcoin ETF, which may involve more than $10 billion in public funds

Treasure Chain will launch AI agent startup platform Mage in the coming weeks, with MAGIC as the core token

DIN launches airdrop query page and announces token economics

Binance Alpha Lists Autonolas (OLAS)

Binance HODLer Airdrop Launches Solayer (LAYER)

Regulatory/Macro

Former Thai Prime Minister Proposes Developing Phuket into a Bitcoin Sandbox Zone

According to Bitcoin News, former Thai Prime Minister Thaksin Shinawatra proposed developing Phuket into a Bitcoin sandbox zone, allowing foreign tourists to use Bitcoin to pay for real estate and tourism-related expenses without being restricted by cash.

Four.Meme suffered a malicious attack and has urgently suspended DEX transactions

According to the official announcement of Four.Meme, the project is currently experiencing a malicious attack, and the team has quickly intervened to deal with it. To ensure safety, the token trading of the decentralized exchange (DEX) has been temporarily suspended and will be reopened after the repair is completed.

Japanese gaming company Gumi announces purchase of $6.6 million in Bitcoin and plans to participate in BTC staking

According to The Block, Tokyo-listed mobile game company Gumi Inc. announced plans to purchase 1 billion yen (about 6.6 million U.S. dollars) worth of Bitcoin between February and May to strengthen its Web3 business and node operations. Gumi said that the company will use excess Bitcoin funds to participate in the Babylon Bitcoin staking agreement, and expects to obtain additional income through BTC price increases, staking income and validator rewards. Gumi became the first listed company in Japan to participate in the Babylon agreement and will conduct a fair value assessment of cryptocurrency holdings every quarter. In addition, Japanese investment advisory company Metaplanet Inc. previously announced the establishment of a Bitcoin reserve, currently holding 1,762 BTC, and plans to expand to 10,000 BTC by the end of the year.

SEC and Binance jointly apply for a 60-day suspension of litigation, possibly affected by the new crypto regulatory task force

According to Fox Business reporter Eleanor Terrett, the U.S. Securities and Exchange Commission (SEC) and Binance have jointly filed a motion with the court to suspend the SEC's lawsuit against Binance for 60 days. This is the first request for a stay of cryptocurrency litigation since Mark Uyeda took over as acting chairman of the SEC. The documents show that the new crypto regulatory task force established by the SEC may affect the potential resolution of the case, so the SEC proposed a brief suspension of the lawsuit. Binance agreed to this decision and believed that it was in line with the principle of judicial economy. If the court approves, the case will be re-evaluated after 60 days. The market expects that other crypto companies that have legal disputes with the SEC, such as Ripple, Coinbase, and Kraken, may also seek similar applications for suspension of litigation.

NYSE Arca files for Cardano ETF for Grayscale

According to The Block, NYSE Arca, a subsidiary of the New York Stock Exchange, has submitted a 19b-4 document to the U.S. Securities and Exchange Commission (SEC), applying on behalf of Grayscale to launch a Cardano (ADA) spot exchange-traded fund (ETF). The ETF will be custodianed by Coinbase Custody Trust Company, LLC and managed by BNY Mellon Asset Servicing. This is the first ADA-based ETF on the market. The application is the second step in submitting a spot crypto ETF to the SEC. Once accepted by the SEC and published in the Federal Register, the approval process will officially start. Recently, the market has submitted a variety of crypto ETF proposals, including products based on Dogecoin, XRP, Litecoin and Solana.

Supreme Court lawyer Tom Goldstein re-arrested for hiding crypto assets, involved in $8 million in fund transfers

According to CNBC, U.S. federal prosecutors accused well-known Supreme Court lawyer Tom Goldstein of hiding two cryptocurrency wallets that received more than $8 million in funds and transferred $6 million in the past week, violating court orders, and was therefore re-arrested. Goldstein was previously indicted in January for tax evasion, accusing him of failing to report millions of dollars in poker gambling income and using law firm funds to repay gambling debts. He is accused of owing more than $5.3 million in taxes. Prosecutors said he had provided benefits such as cryptocurrency to a key witness, suspected of trying to interfere with witness testimony. Court documents show that since November 2022, wallets controlled by Goldstein have received a total of $75.6 million and sent $73.6 million. Although the wallet funds were zero when he was indicted in January, on February 4, his wallet first received $10 in Tether (USDT), and an hour later received $8 million in USDT, and then quickly transferred $6 million. Prosecutors believe that Goldstein is a serious risk of absconding, violated bail conditions, and deceived the court and pre-trial services, and requested that his bail be revoked. Goldstein appeared in federal court in Maryland on Monday for a bail hearing. The case is still under further review.

The United States announced a 25% tariff on all steel and aluminum imported into the United States

According to the Xinwen Lianbo report, US President Trump signed an executive order announcing a 25% tariff on all steel and aluminum imported into the United States. Trump said on the same day that there would be "no exceptions and exemptions" to the relevant requirements. During his first term, Trump imposed a 25% tariff on steel entering the United States and a 10% tariff on aluminum entering the United States, and later granted duty-free quotas to trading partners such as Canada, Mexico, the European Union and the United Kingdom.

SEC Accepts Physical Redemption Application for 21Shares Bitcoin and Ethereum Spot ETFs

According to Solid Intel, the U.S. Securities and Exchange Commission (SEC) has accepted an application to allow 21Shares Bitcoin and Ethereum spot ETFs to conduct physical redemptions.

North Carolina proposes to invest in Bitcoin ETF, which may involve more than $10 billion in public funds

According to Decrypt, North Carolina lawmakers have proposed investing up to 10% of the state's public funds and retirement system funds in Bitcoin ETFs. The proposal was submitted by Representative Deborah Ross (D-NC) on Monday. If approved, the state government may invest more than $10 billion in Bitcoin-related funds. The bill does not directly mention Bitcoin, but requires investment in ETFs that track digital assets with a market value of at least $750 billion. Currently, the only crypto asset that meets this standard is Bitcoin. North Carolina has actively promoted crypto-friendly legislation in recent years, and has previously passed a bill prohibiting the state government from accepting central bank digital currencies (CBDC) payments. However, some legislators in the state are still cautious about the crypto industry and have proposed banning or strictly regulating crypto mining in Henderson, Polk, Rutherford and other counties. The bill allows the state finance department to invest directly in Bitcoin ETFs or manage them through third-party institutions, but third-party institutions are required to provide annual audited financial reports unless the finance department exempts this requirement based on cost-benefit analysis.

AI

Musk leads $97.4 billion acquisition of OpenAI proposal, but Altman rejects it

According to the Wall Street Journal, a group of investors led by Elon Musk proposed to acquire the non-profit organization that controls OpenAI for $97.4 billion, hoping to restore it to a "public welfare organization with open source and security as its core." In response, OpenAI CEO Sam Altman responded on the X platform: "No, thank you, but if you want, we can acquire Twitter for $9.74 billion." The acquisition proposal was led by Musk's AI company xAI, and investors included Valor Equity Partners, Baron Capital, Atreides Management, Vy Capital, 8VC and Ari Emanuel's investment fund. OpenAI did not respond.

Project News

Treasure Chain will launch AI agent startup platform Mage in the coming weeks, with MAGIC as the core token

Web3 gaming ecosystem Treasure DAO announced the upcoming launch of the Mage platform, a launch platform and ecosystem focused on AI agents, which aims to bring a new experience to games and entertainment through multi-agent collaboration. Mage is built on the @elizaOS framework and is deeply integrated with Treasure's gaming infrastructure. It supports all major game engines and can generate and manage single or group AI agents. The core of the Mage platform is the $MAGIC token, which will serve as the "magic" fuel to summon and maintain the operation of AI agents. In the future, Mage will not only support the gaming field, but will also expand to a wider range of application scenarios to achieve interaction, collaboration and creation between people and AI agents. Mage's first application scenario is Smolworld. The platform is expected to be launched on the Treasure chain in the next few weeks. The first batch of features include the agent launch platform and the initial version of the agent coordination engine. Earlier news, Web3 gaming ecosystem Treasure officially launched the mainnet after migrating to ZKsync.

DIN launches airdrop query page and announces token economics

According to official news, the first AI Agent blockchain DIN has launched the $DIN token airdrop query page. This airdrop is mainly for active contributors to the DIN ecosystem and will be carried out in two phases: Phase 1: Open to xDIN holders and Chipper node holders, users can query the airdrop share from February 11 and start claiming from February 14; Phase 2: Open to participants of Binance wallet airdrop activities and participants of DIN testnet activities, inquiries and claims will be carried out simultaneously within 7 days after TGE. In addition, the DIN team also announced the $DIN token economics: the community and ecosystem can allocate 61.5% of DIN tokens, the team and consultants account for 17.5%, investors account for 16%, and marketing and liquidity account for 5%.

Binance Alpha Lists Autonolas (OLAS)

Binance Alpha platform now lists Autonolas (OLAS). It should be noted that this does not mean that the project will be officially listed on the Binance exchange.

Bithumb will support Solayer (LAYER) Korean Won transactions

Bithumb announced that it will soon launch the Korean Won trading market of Solayer (LAYER). LAYER will support the Solana network, and deposits from other networks will not be supported. Deposit and withdrawal services are expected to be opened at 21:00 on February 11, 2025, but the trading opening time will be notified separately after sufficient liquidity.

Upbit to launch Solayer (LAYER) trading in Korean Won, BTC and USDT

Upbit announced that it will add support for trading of Solana network's digital asset Solayer (LAYER). LAYER will support KRW, BTC and USDT market transactions. Currently, LAYER's deposit service is expected to be opened at 21:00 on February 11, but the trading support time will be notified separately after sufficient liquidity on the platform.

Binance HODLer Airdrop Launches Solayer (LAYER)

According to the Binance announcement, the HODLer airdrop has been launched on the eighth project Solayer (LAYER), and users can apply for the coin-earning product through BNB to obtain the LAYER airdrop. The event time is from 08:00 on February 1 to 07:59 on February 6 (Eastern Time Zone 8), and the airdrop tokens will be distributed to the user's spot wallet 1 hour before the transaction is opened. Binance will list LAYER at 22:00 on February 11 (Eastern Time Zone 8), and open BTC, USDT, USDC, BNB, FDUSD, TRY trading pairs, and seed label trading rules will apply. LAYER airdrop and token details: • Total supply: 1 billion pieces • Total HODLer airdrop: 30 million pieces, accounting for 3% of the maximum supply • Additional marketing allocation: 20 million pieces, which will be distributed 3 months after listing • Circulating supply before listing: 210 million pieces, accounting for 21% of the maximum supply • BNB holding hard cap: single user holding ratio ≤4%

Bithumb will list Story (IP) Korean Won trading pair, trading will be open on February 13

According to the Bithumb announcement, Story (IP) will be launched on the Korean Won (KRW) market soon. The specific arrangements are as follows: • Supported markets: Korean Won (KRW) trading pairs • Supported networks: Story (does not support deposits on other networks) • Deposit/withdrawal opening time: Expected February 13 (time to be determined) • Trading opening time: Expected February 13 (time to be determined)

OKX will launch IP spot trading on February 13

According to the OKX announcement, IP (Story Protocol) will be officially launched for spot trading on February 13th. The specific arrangements are as follows: • Deposits open: 9:30 am on February 11th (UTC+8) • Call auction: 4:00 to 5:00 pm on February 13th (UTC+8) • IP/USDT spot trading opens: 5:00 pm on February 13th (UTC+8) • Withdrawals open: 5:00 pm on February 14th (UTC+8)

Story mainnet will be launched on February 13, $IP claiming and query will be open simultaneously

According to Story's official announcement, its public mainnet will be officially launched on February 13. At the same time, the $IP token claim and query function will also be opened on the same day, and users can check and claim the corresponding allocation.

Berachain opens RFB and social airdrops, which will not affect the circulation of BERA

According to the Berachain Foundation announcement, RFB and Social airdrops are now available, and users can go to airdrop.berachain.com to apply. RFB is distributed to applications and communities that have been building the Berachain ecosystem for a long time, and recipients must follow the official guidelines. In addition, Berachain emphasized that RFB and social distributions are included in the initial circulation supply of tokens and will not affect the current circulation of BERA.

Coinbase now has B3 on the Base network

According to the Coinbase Assets announcement, Coinbase will support B3 (Base) tokens, limited to the Base network. B3's transfer function is now open on Coinbase and Coinbase Exchange. B3 (Base) (B3) is now available on the Coinbase official website and iOS and Android applications, and is marked as an "experimental" asset. Coinbase users can log in to the platform to buy, sell, convert, send, receive and store B3.

Viewpoint

FTX creditors: If SBF had not filed for bankruptcy, its asset valuation would have exceeded $65 billion

According to Sunil, a representative of FTX creditors, if SBF had not filed for bankruptcy, the valuation of its assets might exceed $65 billion, including: 55 million Solana (about $11 billion), Anthropic ($4.2 billion), 890 million Sui tokens and equity ($3.2 billion), GDA investment (more than $1.2 billion), K5 investment (US$700 million, including $190 million from SpaceX), FTX business valuation (US$40 million net income corresponding to a valuation of $40 billion), and 280 million FTT tokens (about $5 billion). According to previous news, the total net assets of the world's top 500 richest people will exceed the $10 trillion mark in 2024, and CZ's wealth will rise 60% to $55 billion.

Matrixport: Ethereum may rebound due to low RSI and upgrade plan

Matrixport reported today that Ethereum's relative strength index (RSI) has fallen to a historical low, close to the extreme oversold range, which may provide conditions for ETH prices to rebound. In addition, Ethereum's highly anticipated Pectra upgrade is scheduled to be launched in March 2025. This upgrade integrates the original Prague and Electra versions and is expected to significantly improve the network's scalability, efficiency and user experience. The report also mentioned that before the upgrade is officially launched in March, the market may issue multiple test network announcements, which may further boost market sentiment. Although upgrade events in Ethereum's history are often accompanied by "sell news" market conditions, the current oversold market background may create opportunities for ETH prices to rebound.

Analysts predict the probability of approval of LTC, DOGE, SOL, and XRP spot ETFs, with LTC being as high as 90%

According to statistics from analysts James Seyffart and Eric Balchunas, the current market has a relatively high probability of approval for Litecoin (LTC), Dogecoin (DOGE), Solana (SOL), and XRP spot ETFs. Among them: • Litecoin (LTC): 90%, because it is considered a high-probability commodity by the SEC • Dogecoin (DOGE): 75%, also considered a commodity by the SEC with a high probability • Solana (SOL): 70%, but the SEC still regards it as a security • XRP: 65%, mainly affected by the SEC lawsuit and the need to resolve regulatory disputes Seyffart said that the ETF applications for XRP and DOGE are expected to be accepted by the SEC this week, and the SEC and Commissioner Hester Peirce's crypto working group are expected to resolve some of the "securities vs. commodities" regulatory disputes by the end of 2025. He pointed out that if the Democratic Party still dominates the SEC, the probability of approval of these ETFs will be "very low." In addition, Seyffart emphasized that the biggest obstacle to the approval of the XRP ETF is still the lawsuit with the SEC. The SEC needs to sort out the Ripple case first before the ETF has a higher probability of passing.

Important data

Binance is suspected of significantly reducing its BTC and ETH holdings last month, turning to USDC, and the proportion of BNB reduction is relatively low

According to crypto KOL AB Kuai.Dong, Binance significantly reduced its own BTC and ETH holdings in January and converted most of its assets into stablecoin USDC. Among them, BTC holdings fell from 46,896 to 2,747 (a decrease of 94.1%), ETH holdings fell from 216,313 to 175 (a decrease of 99.9%), SOL holdings fell by 99%, and USDT holdings were almost zero (a decrease of 99.9%). In contrast, BNB's reduction ratio was lower, only 16.6%, from 5.839 million to 4.869 million, with a change value of approximately US$615 million. At the same time, Binance's USDC holdings increased by 57.5%, from 805 million to 1.268 billion, with an increase of US$463 million. The data comes from Binance's reserve certificate, which mainly involves the platform's own funds, not user deposits. Analysts believe that this move may be to accrue profits, adjust asset structure, enhance liquidity, or prepare for future regulation and market fluctuations. Some users also said that the reduction in holdings was most likely to pay fines to US regulators.

Bitcoin spot ETF had a net outflow of US$186 million yesterday, and the ETF net asset ratio reached 5.93%

According to SoSoValue data, yesterday (February 10, Eastern Time), the total net outflow of Bitcoin spot ETFs was $186 million. Among them, Grayscale ETF GBTC had a net outflow of $46.2605 million in a single day, and the historical net outflow of GBTC has reached $21.952 billion, while Grayscale Bitcoin Mini Trust ETF BTC had no capital flow yesterday, with a total historical net inflow of $1.237 billion. BlackRock ETF IBIT had a net inflow of $55.3647 million yesterday, making it the Bitcoin spot ETF with the largest inflow on that day. Currently, the total historical net inflow of IBIT has reached $40.85 billion. As of press time, the total net asset value of Bitcoin spot ETFs is $114.437 billion, and the ETF net asset ratio (market value to total Bitcoin market value) is 5.93%, with a historical cumulative net inflow of $40.514 billion.

2 Whale addresses withdrew more than 120,000 ETH from exchanges in the past 48 hours, with a total value of more than 320 million US dollars

According to Lookonchain monitoring, whale addresses are massively increasing their holdings of ETH. Among them, address 0xb99a…BcF5 withdrew 56,909 ETH (about $151.6 million) from Binance 4 hours ago, and address 0xEd0C…4312 withdrew 64,603 ETH (about $171.8 million) from Binance and Bitfinex in the past 48 hours.

Ambraxas Capital withdraws 24,000 ETH from Binance, about $64 million

According to The Data Nerd, 6 hours ago, Ambraxas Capital’s related wallets withdrew 24,000 ETH (about 64.04 million USD) from Binance. Currently, the total value of the institution’s investment portfolio has exceeded 500 million USD, of which about 50% is held in ETH.

Disclaimer: The articles reposted on this site are sourced from public platforms and are provided for informational purposes only. They do not necessarily reflect the views of MEXC. All rights remain with the original authors. If you believe any content infringes on third-party rights, please contact service@support.mexc.com for removal. MEXC makes no guarantees regarding the accuracy, completeness, or timeliness of the content and is not responsible for any actions taken based on the information provided. The content does not constitute financial, legal, or other professional advice, nor should it be considered a recommendation or endorsement by MEXC.
Share Insights

You May Also Like

Bitcoin White Paper: A Peer-to-Peer Cash System

Bitcoin White Paper: A Peer-to-Peer Cash System

PANews Editor's Note: On October 31, 2008, Satoshi Nakamoto published the Bitcoin white paper, and today marks its 17th anniversary. The following is a translation of the white paper by Li Xiaolai, for everyone to revisit this classic work. Summary: A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. While digital signatures offer a partial solution, the main advantage of electronic payments is negated if a trusted third party is still required to prevent double-spending. We propose a scheme using a peer-to-peer network to address the double-spending problem. The peer-to-peer network timestamps each transaction by recording the transaction's hash data onto a continuously expanding, hash-based proof-of-work chain, forming a record that cannot be altered unless completely rewritten. The longest chain serves two purposes: proving witnessed events and their order, and simultaneously proving it originated from the largest pool of CPU power. As long as the vast majority of CPU power is controlled by benign nodes—that is, nodes that do not cooperate with those attempting to attack the network—benign nodes will generate the longest chain and outpace attackers. The network itself requires a minimal structure. Information will propagate on a best-effort basis, and nodes are free to come and go; however, upon joining, they must always accept the longest proof-of-work chain as proof of everything that happened during their absence. 1. Introduction Internet commerce relies almost entirely on financial institutions as trusted third parties to process electronic payments. While this system works reasonably well for most transactions, it is still hampered by the inherent flaws of its trust-based model. Completely irreversible transactions are practically impossible because financial institutions cannot avoid arbitrating disputes. Arbitration costs increase transaction costs, which in turn limit the minimum possible transaction size and effectively prevent many small payments. Beyond this, there are even greater costs: the system cannot provide irreversible payments for irreversible services. The possibility of reversibility creates an omnipresent need for trust. Merchants must be wary of their customers, requiring them to provide additional information that would otherwise be unnecessary (if trusted). A certain percentage of fraud is considered unavoidable. These costs and payment uncertainties, while avoidable when paying with physical currency directly between people, lack any mechanism that allows payments to be made through communication channels when one party is not trusted. What we truly need is an electronic payment system based on cryptographic proofs rather than trust, allowing any two parties to transact directly without needing to trust a third party. Irreversible transactions guaranteed by computational power help sellers avoid fraud, while everyday guarantee mechanisms to protect buyers are easily implemented. In this paper, we propose a solution to double-spending by using peer-to-peer, distributed timestamping servers to generate computational power-based proofs, recording each transaction chronologically. This system is secure as long as honest nodes collectively possess more CPU power than colluding attackers. 2. Transactions We define an electronic coin as a digital signature chain. When an owner transfers a coin to another person, they append the following digital signature to the end of this chain: the hash of the previous transaction and the new owner's public key. The recipient can verify ownership of the digital signature chain by verifying the signature. The problem with this approach is that the recipient cannot verify that none of the previous owners have double-spended the currency. A common solution is to introduce a trusted centralized authority, or "mint," to check every transaction for double-spending. After each transaction, the coin must return to the mint, which then issues a new coin. Thus, only coins directly issued by the mint are considered trustworthy and free from double-spending. The problem with this solution is that the fate of the entire monetary system is tied to the company operating the mint (much like a bank), and every transaction must go through it. We need a way for the recipient to confirm that the previous owner did not sign any previous transactions. For our purposes, only the earliest transaction counts, so we are not concerned with subsequent double-spending attempts. The only way to confirm the non-existence of a transaction is to know all transactions. In the mint model, the mint already knows all transactions and can confirm their order. To accomplish this without the involvement of a "trusted party," the transaction record must be publicly announced, thus requiring a system that allows participants to agree on the same unique transaction history they receive. The recipient needs to prove that at the time each transaction occurs, a majority of nodes agree that it was the first one received. 3. Timestamp Server This solution begins with a timestamp server. A timestamp server works by timestamping the hash of a block of items and then broadcasting the hash, much like a newspaper does or a post in a Usenet newsgroup [2-5]. Clearly, the timestamp proves that the data existed before that point in time; otherwise, the hash couldn't be generated. Each timestamp contains previous timestamps in its hash, thus forming a chain; each new timestamp is added after the previous ones. 4. Proof of Work To implement a peer-to-peer distributed timestamp server, we need a proof-of-work system similar to Adam Burke's HashCash, rather than something like a newspaper or newsgroup post. Proof-of-work involves finding a value that meets the following condition: after hashing it—for example, using SHA-256—the hash must begin with a certain number of zeros. Each additional zero increases the workload exponentially, while verifying this workload only requires calculating a single hash. In our timestamp network, we implement proof-of-work as follows: A random number is continuously added to each block until a value that meets a condition is found: the block's hash begins with a specified number of zeros. Once the CPU's computational power yields a result that satisfies the proof-of-work, the block can no longer be modified unless all previous work is redone. As new blocks are continuously added, modifying the current block means redoing the work for all subsequent blocks. Proof-of-Work (PoL) also solves the problem of determining who represents the majority in making decisions. If the so-called "majority" is determined by a "one IP address, one vote" system, then anyone who can control a large number of IP addresses could be considered part of the "majority." PoL, in essence, is "one CPU, one vote." The so-called "majority decision" is represented by the longest chain, because it's the chain with the most work invested. If the majority of CPU power is controlled by honest nodes, then the honest chain grows the fastest, far outpacing other competing chains. To change an already generated block, an attacker would have to re-complete the proof-of-work for that block and all subsequent blocks, and then catch up with and surpass the work done by the honest nodes. The following section explains why the probability of a delayed attacker catching up decreases exponentially with the number of blocks. To cope with the continuous increase in overall hardware computing power and the potential changes in the number of participating nodes over time, the proof-of-work difficulty is determined by a moving average based on the average number of blocks generated per hour. If blocks are generated too quickly, the difficulty will increase. 5. Network The steps to run a network are as follows: All new transactions are broadcast to all nodes; Each node packages new transactions into a block; Each node begins by finding a challenging proof-of-work for this block; When a block finds its proof of work, it must broadcast this block to all nodes; Many other nodes will accept a block if and only if all of the following conditions are met: all transactions in the block are valid and have not been double-spended; The way numerous nodes indicate to the network that they accept a block is to use the hash of the accepted block as the hash of the previous block when creating the next block. Nodes consistently recognize the longest chain as correct and continuously add new data to it. If two nodes simultaneously broadcast two different versions of the "next block," some nodes will receive one first, while others will receive the other. In this case, nodes will continue working on the block they received first, but will also save the other branch in case the latter becomes the longest chain. When the next proof-of-work is found, and one of the branches becomes the longer chain, this temporary divergence is resolved, and the nodes working on the other branch will switch to the longer chain. New transactions don't necessarily need to be broadcast to all nodes. Once they reach enough nodes, they will soon be packaged into a block. Block broadcasting also allows some messages to be dropped. If a node doesn't receive a block, it will realize it missed the previous block when it receives the next block, and will therefore issue a request to resubmit the missing block. 6. Incentive As agreed, the first transaction of each block is a special transaction that generates a new coin, owned by the block's creator. This rewards nodes that support the network and provides a way to issue coins into circulation—in this system, there's no centralized authority issuing those coins. This steady increase in the number of new coins entering circulation is analogous to gold miners continuously consuming their resources to add gold to the system. In our system, the resources consumed are CPU time and the electricity they use. Rewards can also come from transaction fees. If the output value of a transaction is less than its input value, the difference is the transaction fee; this fee is used to reward nodes for including the transaction in the block. Once a predetermined number of coins are in circulation, the rewards will be entirely distributed through transaction fees, and there will be absolutely no inflation. The reward mechanism may also incentivize nodes to remain honest. If a greedy attacker manages to acquire more CPU power than all honest nodes combined, he must choose: use that power to cheat others by stealing back the money he's spent, or use it to generate new coins? He should be able to see that following the rules is more advantageous; the current rules allow him to acquire more coins than all the others combined, which is clearly more profitable than secretly destroying the system and losing his wealth. 7. Reclaiming Disk Space If a coin's most recent transaction occurred a sufficient number of blocks ago, then all previous transactions involving that coin can be discarded—this is to save disk space. To achieve this without corrupting the block's hash, the transaction hashes are incorporated into a Merkle tree [7, 2, 5], with only the root of the tree included in the block's hash. By pruning the branches, older blocks can be compressed. The internal hashes do not need to be preserved. A block header without any transactions is approximately 80 bytes. Assuming a block is generated every ten minutes, 80 bytes multiplied by 6, 24, and 365 equals 4.2 MB per year. As of 2008, most computers on the market had 2GB of RAM, and according to Moore's Law, this would increase by 1.2 GB per year, so even if block headers had to be stored in memory, it wouldn't be a problem. 8. Simplified Payment Verification Payment confirmation is possible even without running a full network node. A user only needs a copy of the block header from the longest chain with proof-of-work—which they can verify by checking online nodes to confirm it comes from the longest chain—and then obtains the branch node of the Merkle tree, connecting to the transaction at the time the block was timestamped. The user cannot check the transaction themselves, but by connecting to somewhere on the chain, they can see that a network node has accepted the transaction, and subsequent blocks further confirm that the network has accepted it. As long as honest nodes retain control of the network, verification remains reliable. However, verification becomes less reliable if the network is controlled by an attacker. Although network nodes can verify transaction records themselves, simplified verification methods can be fooled by forged transaction records if an attacker maintains control of the network. One countermeasure is for client software to receive alerts from network nodes. When a network node discovers an invalid block, it issues an alert, displays a notification on the user's software, instructs the user to download the complete block, and warns the user to confirm transaction consistency. Merchants with high-frequency transactions should still prefer to run their own full nodes to ensure greater independent security and faster transaction confirmation. 9. Combining and Splitting Value While processing coins one by one is possible, keeping a separate record for each penny is cumbersome. To allow for the division and merging of value, transaction records contain multiple inputs and outputs. Typically, there is either a single input from a relatively large previous transaction, or a combination of many inputs from smaller amounts; meanwhile, there are at most two outputs: one is the payment (to the recipient), and if necessary, the other is the change (to the sender). It's worth noting that "fan-out" isn't the issue here—"fan-out" refers to a transaction that depends on several transactions, which in turn depend on even more transactions. There's never any need to extract a complete, independent historical copy of any single transaction. 10. Privacy Traditional banking models achieve a degree of privacy by restricting access to information about transacting parties and trusted third parties. This approach is rejected due to the need to make all transaction records public. However, maintaining privacy can be achieved by cutting off the flow of information elsewhere—public-key anonymity. The public can see that someone transferred a certain amount to someone else, but no information points to a specific individual. This level of information disclosure is somewhat like stock market transactions, where only the time and the amounts of each transaction are published, but no one knows who the transacting parties are. 11. Calculations Imagine an attacker attempting to generate an alternative chain that is faster than the honest chain. Even if he succeeds, it won't leave the current system in an ambiguous situation; he cannot create value out of thin air, nor can he acquire money that never belonged to him. Network nodes will not accept an invalid transaction as a payment, and honest nodes will never accept a block containing such a payment. At most, the attacker can only modify his own transactions, attempting to retrieve money he has already spent. The competition between the honest chain and the attacker can be described using a binomial random walk. A successful event is when a new block is added to the honest chain, increasing its advantage by 1; while a failed event is when a new block is added to the attacker's chain, decreasing the honest chain's advantage by 1. The probability that an attacker can catch up from a disadvantaged position is similar to the gambler's bankruptcy problem. Suppose a gambler with unlimited chips starts from a deficit and is allowed to gamble an unlimited number of times with the goal of making up the existing deficit. We can calculate the probability that he can eventually make up the deficit, which is the probability that the attacker can catch up with the honesty chain[8], as follows: Since we have already assumed that the number of blocks an attacker needs to catch up with is increasing, their probability of success decreases exponentially. When the odds are against them, if the attacker doesn't manage to make a lucky forward move at the beginning, their chances of winning will be wiped out as they fall further behind. Now consider how long a recipient of a new transaction needs to wait to be fully certain that the sender cannot alter the transaction. Let's assume the sender is an attacker attempting to mislead the recipient into believing they have paid the due, then transfer the money back to themselves. In this scenario, the recipient would naturally receive a warning, but the sender would prefer that by then the damage is done. The recipient generates a new public-private key pair and then informs the sender of the public key shortly before signing. This prevents a scenario where the sender prepares a block on a chain in advance through continuous computation and, with enough luck, gets ahead of the time until the transaction is executed. Once the funds have been sent, the dishonest sender secretly begins working on another parachain, attempting to insert a reverse version of the transaction. The recipient waits until the transaction is packaged into a block, and then another block is subsequently added. He doesn't know the attacker's progress, but can assume the average time for an honest block to be generated in each block generation process; the attacker's potential progress follows a Poisson distribution with an expected value of: To calculate the probability that the attacker can still catch up, we multiply the Passon density of each attacker's existing progress by the probability that he can catch up from that point: To avoid rearranging the data after summing the infinite series of the density distribution… Convert to C language program... From the partial results, we can see that the probability decreases exponentially as Z increases: If P is less than 0.1%... 12. Conclusion We propose an electronic transaction system that does not rely on trust. Starting with a simple coin framework using digital signatures, while providing robust ownership control, it cannot prevent double-spending. To address this, we propose a peer-to-peer network using a proof-of-work mechanism to record a public transaction history. As long as honest nodes control the majority of CPU power, attackers cannot successfully tamper with the system solely from a computational power perspective. The robustness of this network lies in its unstructured simplicity. Nodes can work simultaneously instantaneously with minimal coordination. They don't even need to be identified, as message paths do not depend on a specific destination; messages only need to be propagated with best-effort intent. Nodes are free to join and leave, and upon rejoining, they simply accept the proof-of-work chain as proof of everything that happened while they were offline. They vote with their CPU power, continuously adding new valid blocks to the chain and rejecting invalid ones, indicating their acceptance of valid transactions. Any necessary rules and rewards can be enforced through this consensus mechanism.
Share
PANews2025/10/31 17:05