ReasonJun

Block Structure (Size : 1MB) Size Field Description 4 bytes Block Size Size of Block 80 bytes Block Header Block Header Info 1 ~ 9 bytes Transaction Counter Number of transactions in the current block (0 ~ 3000) Variable Transaction Transaction list in Block Block Header Structure Size Field Description 4 bytes Version version info (95%^ => 2016 Block Upgrade) 32 bytes Previous Block Hash Previo..

The reason why Gossip Protocol (TCP) is used is that when a transaction occurs, it must be able to push even if there is no request. When a transaction occurs in one node, the information must be spread to other nodes as quickly and widely as possible. At this time, whether each transaction is correct is determined by the basic rules and consensus algorithm of the Bitcoin network. Join a network..

gRPC and HTTP API are two different technologies used for building and interacting with APIs (Application Programming Interfaces). They have distinct characteristics and use cases: gRPC: Definition: gRPC stands for "Google Remote Procedure Call." It is an open-source RPC (Remote Procedure Call) framework developed by Google. Communication Protocol: gRPC uses HTTP/2 as its underlying communicatio..

A Merkle Tree, often referred to simply as a Merkle Tree or a hash tree, is a fundamental data structure used in Bitcoin and other blockchain systems to efficiently represent and verify the integrity of a large set of data, such as transactions in a block. The Merkle Tree is named after its inventor, Ralph Merkle. Here's how it works in the context of Bitcoin: Structure of a Merkle Tree: A Merkl..

What is ECDSA? ECDSA is a public-key digital signature algorithm that provides a secure way to verify the authenticity and integrity of digital messages or documents. It is based on elliptic curve cryptography (ECC), which is known for its efficiency and security. Here's how ECDSA works: Key Generation: A user generates a pair of cryptographic keys: a private key (known only to the owner) and a ..

RSA (Rivest–Shamir–Adleman): RSA is a widely used public-key cryptosystem for encryption and digital signatures. It relies on the mathematical properties of large prime numbers. Here's a simplified explanation of how RSA works: Key Generation: Choose two large prime numbers, p and q. Compute their product, n = p * q. Calculate φ(n) = (p - 1) * (q - 1), where φ is Euler's totient function. Select..