Bitcoin: A Peer-to-Peer Electronic Cash System Satoshi Naka | TumeloPat_Crypto trên Binance Square

Bài viết thịnh hành

Đã thích và đánh dấu trang

Trung tâm Nhà sáng tạo

Xem bản gốc

TumeloPat_Crypto

--

Bitcoin: Hệ thống tiền điện tử ngang hàng
Satoshi Nakamoto
satoshin@gmx.com
bitcoin.org

Tuyên bố miễn trừ trách nhiệm: Bao gồm cả quan điểm của bên thứ ba. Đây không phải lời khuyên tài chính. Có thể bao gồm nội dung được tài trợ. Xem Điều khoản & Điều kiện.

BTC

61.600

-5.87%

136

0

Phản hồi 0

Tìm hiểu tin tức mới nhất về tiền mã hóa

⚡️ Hãy tham gia những cuộc thảo luận mới nhất về tiền mã hóa

💬 Tương tác với những nhà sáng tạo mà bạn yêu thích

👍 Thưởng thức nội dung mà bạn quan tâm

Email / Số điện thoại

Nhà sáng tạo có liên quan

TumeloPat_Crypto

@TumeloPat

Khám phá thêm từ Nhà sáng tạo nội dung

May the holiday season bring Binance the gift of seamless transactions, the joy of technological advancements, and the warmth of a thriving crypto community. Here's to a Christmas filled with bullish trends and a New Year brimming with blockchain brilliance! #BinanceWish $BNB Hasib_Dadu CryptoTalker

--

6. Incentive By convention, the first transaction in a block is a special transaction that starts a new coin owned by the creator of the block. This adds an incentive for nodes to support the network, and provides a way to initially distribute coins into circulation, since there is no central authority to issue them. The steady addition of a constant of amount of new coins is analogous to gold miners expending resources to add gold to circulation. In our case, it is CPU time and electricity that is expended. The incentive can also be funded with transaction fees. If the output value of a transaction is less than its input value, the difference is a transaction fee that is added to the incentive value of the block containing the transaction. Once a predetermined number of coins have entered circulation, the incentive can transition entirely to transaction fees and be completely inflation free. The incentive may help encourage nodes to stay honest. If a greedy attacker is able to assemble more CPU power than all the honest nodes, he would have to choose between using it to defraud people by stealing back his payments, or using it to generate new coins. He ought to find it more profitable to play by the rules, such rules that favour him with more new coins than everyone else combined, than to undermine the system and the validity of his own wealth. #BinanceSquare #Binance #bnbburn #BitcoinWorld #bitcoin $BTC

--

5. Network The steps to run the network are as follows: New transactions are broadcast to all nodes. Each node collects new transactions into a block. Each node works on finding a difficult proof-of-work for its block. When a node finds a proof-of-work, it broadcasts the block to all nodes. Nodes accept the block only if all transactions in it are valid and not already spent. In that case, they work on the first one they received, but save the other branch in case it becomes longer. block as the previous hash. Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash. Nodes always consider the longest chain to be the correct one and will keep working on extending it. If two nodes broadcast different versions of the next block simultaneously, some nodes may receive one or the other first. In that case, they work on the first one they received, but save the other branch in case it becomes longer. New transaction broadcasts do not necessarily need to reach all nodes. As long as they reach many nodes, they will get into a block before long. Block broadcasts are also tolerant of dropped messages. If a node does not receive a block, it will request it when it receives the next block and realizes it missed one. #bnbburn #BitcoinWorld #bitcoin #Binance #BinanceSquare

--

3. Timestamp Server The solution we propose begins with a timestamp server. A timestamp server works by taking a hash of a block of items to be timestamped and widely publishing the hash, such as in a newspaper or Usenet post [2-5]. The timestamp proves that the data must have existed at the time, obviously, in order to get into the hash. Each timestamp includes the previous timestamp in its hash, forming a chain, with each additional timestamp reinforcing the ones before it. #BinanceSquare #bitcoin #BitcoinWorld #BNB #trading

--

4. Proof-of-Work To implement a distributed timestamp server on a peer-to-peer basis, we will need to use a proof-of-work system similar to Adam Back’s Hashcash[6], rather than newspaper or Usenet posts. The proof-of-work involves scanning for a value that when hashed, such as with SHA-256, the hash begins with a number of zero bits. The average work required is exponential in the number of zero bits required and can be verified by executing a single hash. For our timestamp network, we implement the proof-of-work by incrementing a nonce in the block until a value is found that gives the block’s hash the required zero bits. Once the CPU effort has been expended to make it satisfy the proof-of-work, the block cannot be changed without redoing the work. As later blocks are chained after it, the work to change the block would include redoing all the blocks after it. The proof-of-work also solves the problem of determining representation in majority decision making. If the majority were based on one-IP-address-one-vote, it could be subverted by anyone able to allocate many IPs. Proof-of-work is essentially one-CPU-one-vote. The majority decision is represented by the longest chain, which has the greatest proof-of-work effort invested in it. If a majority of CPU power is controlled by honest nodes, the honest chain will grow the fastest and outpace any competing chains To modify a past block, an attacker would have to redo the proof-of-work of the block and all blocks after it and then catch up with and surpass the work of the honest nodes. We will show later that the probability of a slower attacker catching up diminishes exponentially as subsequent blocks are added. To compensate for increasing hardware speed and varying interest in running nodes over time, the proof-of-work difficulty is determined by a moving average targeting an average number of blocks per hour. If they’re generated too fast, the difficulty increases. #BinanceSquare #BTC #BitcoinWorld #uniswap #ftx

--

Tin tức mới nhất

Độ khó khai thác Bitcoin đạt mức cao nhất mọi thời đại

--

Mã thông báo Meme của hệ sinh thái Solana FWOG giảm đáng kể

--

Báo cáo kỹ thuật số Marathon bỏ lỡ doanh thu, cổ phiếu giảm

--

Bitcoin(BTC) giảm xuống dưới 62.000 USDT với mức giảm 4,44% sau 24 giờ

--

MicroStrategy có kế hoạch huy động 2 tỷ USD thông qua việc bán cổ phiếu loại A

--

Bài viết thịnh hành

Những số liệu chính này đang đưa DeFi lên mức cao nhất năm 2022

Giá Pepe lao dốc khi hoạt động của cá voi tăng vọt: Điều gì tiếp theo cho PEPE?

Tỷ phú tiền điện tử Novogratz cho biết năm 2024 là năm quan trọng đối với ngành khai thác Bitcoin

Ripple phân bổ 10 triệu USD cho tín phiếu kho bạc Hoa Kỳ được token hóa trên sổ cái XRP

Powell gửi Ripple thông qua thị trường tiền điện tử với những tuyên bố quan trọng

Sơ đồ trang web

Cookie Preferences

Điều khoản & Điều kiện

Sơ đồ trang web

Điều khoản & Điều kiện

ba-one-trust-cookie