সাতোশি নাকামোটো

অক্টোবর ৩১, ২০০৮

সারসংক্ষেপ

অধ্যায়

ইন্টারনেটে বাণিজ্য হোক কেন না! তাই হতে পারে, যেনটি একটি বিতরক পর-থেকে-পর ইলেকট্রনিক মুদ্রা অনুমোদন দেয় যৌথের বাহিত। ডিজিটাল স্বাক্ষর সমাধানের অংশ প্রদান করে, এবং মৌলিক উপকার হারান যদি এখনও এমন একটি বিশ্বাসযোগ্য তৃতীয় পার্টি প্রয়োজন থাকে যাতে সদৃশ ব্যয় না হয়। ডাবল-ব্যয় প্রবণি একটি সমাধান প্রস্তাবন পীযো-পীযো-পিয়ার নেটওয়ার্ক ব্যবহার করে সমাধান করতে। নেটওয়ার্ককে হ্যাশ করে মূল্যায়ন করে ট্রান্সয়েকশনগুলিকে এছাড়া হ্যাশ ভিত্তিক প্রুফ-অব-ওয়র্ক চেইনের এবং পুনরায় করা ছাড়া না হতে নাপা রেকর্ড দিয়। সর্বদা ছোট্ট স্ট্রাকচার আমিন। সাঙ্কেতিক প্রযোজনে বার্তা সেরা প্রয়াসের ভিত্তিতে প্রচার হয়, এবং নোডগুলিকে ইচ্ছা মতো ছেড়ের সা�

1۔ পরিচিতি

ইন্টারনেটে বাণিজ্য এবং ক্রয়-বিক্রয় প্রধানত আমলিত হয় ফাইনান্সিয়াল প্রতিষ্ঠানের মাধ্যমে তাহলে অধিকাংশের ট্রান্সাকশনের জন্য। যদিও সিস্টেমের বহুত্তম ট্রান্সাকশনের জন্য কাজ করে, প্রয়োজনের জন্যতে অবষ্ট্ত দুর্বলতা আছে। সর্বাত্মকভাবে নির্দিষ্ট সেরা সেবা হার করা যায় না, কারণ আর্থিক প্রতিষ্ঠানরা বিতर্ক প্রতিস্ঠান ছাড়া ডিস�

নির্দশন দরকার ক্রিপ্টো প্রমাণের উপর ভিত্তি রাখার জন্য একটি ইলেকট্রনিক প্রদান সিস্টেম। এটি কোনও দমনযোগ্য করত্তব্যপ্রদানীর প্রয়োজনকে ছাড়া, সরাদে যেমন দুটি ই�

Abstract

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. Digital signatures provide part of the solution, but the main benefits are lost -> if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can ->leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.

1. ভূমিকা

ইন্টারনেটে বাণিজ্য এবং ক্রয়-বিক্রয�

What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers. In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to ->generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.

সংক্ষেপে

2. লেনদেন

We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding...

The problem of course is the payee can't verify that one of the owners did not double-spend the coin. A common solution is to introduce a trusted central authority, or mint, that checks every ->transaction for double spending. After each transaction, the coin must be returned to the mint to issue a new coin, and only coins issued directly from ->the mint are trusted not to be double-spent. The problem with this solution is that the fate of the entire money system depends on the ->company running the mint, with every transaction...

নাম

3. সময়ছাঁপ সার�

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. 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...

4�=>�প্রমাণ-অব-ওয়ার্ক

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, 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...

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...

Abstract

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. Digital signatures provide part of the solution, but the main benefits are lost -> if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can ->leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.

1. ভূমিকা

ইন্টারনেটে বাণিজ্য এবং ক্র�

What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers. In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to ->generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.

�াহিপ্প্রভাষণ

2. লেন্দেন

We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding...

The problem of course is the payee can't verify that one of the owners did not double-spend the coin. A common solution is to introduce a trusted central authority, or mint, that checks every ->transaction for double spending. After each transaction, the coin must be returned to the mint to issue a new coin, and only coins issued directly from ->the mint are trusted not to be double-spent. The problem with this solution is that the fate of the entire money system depends on the ->company running the mint, with every transaction...

প প �াচো; অটো = ডাবল: সকেসফুল প্রতীতÐ�( ডাবল কিউ, ঔিং জেত�) { ডাবল; প = 1.০ - কিউ; ডাবল; ল্যা ড = জেত �* (কিউ / প); ডাবল; সম = 1.০; ইন্ট, ক; �র (ক = ০; ক \ < � �০; ক++){