Hive

msss (25)in #bitcoin • 7 years ago
Bitcoin 56 백서
Old blocks can then be compacted by stubbing off branches of the tree. 오래된 블럭들은 트리의 가지들을 토막내어 결속되어질 수 있다. The interior hashes do not need to be stored. 내부 해쉬들은 저장되어질 필요가 없다.…
$0.00
6 1
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 55
To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree [7][2][5], with only the root included in the block's hash. 블럭의 해시를 깨지 않고 이것을 가능하게…
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 54
#7. Reclaiming Disk Space #7. 디스크 공간 재활용 Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk…
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 53
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…
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 52
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…
$0.00
1 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 51
Once a predetermined number of coins have entered circulation, the incentive can transition entirely to transaction fees and be completely inflation free. 미리 결정된 코인의 수가 유통될 때…
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin. 백서 50
In our case, it is CPU time and electricity that is expended. 우리의 경우에는 소비되어지는 것은 CPU 타임과 전력이다. The incentive can also be funded with transaction fees. 보상은 또한 거래수수료와 함께 기금이 될…
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 49
The steady addition of a constant of amount of new coins is analogous to gold miners expending resources to add gold to circulation. 새 코인 정량의 고정적인 부가는 금을 유통시키기위해 자원을 소비하는 금 채굴자들과 유사하다.
$0.00
1 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 48
#6. Incentive #6. 보상 By convention, the first transaction in a block is a special transaction that starts a new coin owned by the creator of the block. 전통에 따라, 한 블럭에서 첫 거래는 그…
$0.00
1 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 47
New transaction broadcasts do not necessarily need to reach all nodes. 새로운 거래 광고는 모든 노드들에게 도달하기 위해 필수적으로 필요한 것은 아니다. As long as they reach many nodes, they will get into a…
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 46
Nodes always consider the longest chain to be the correct one and will keep working on extending it. 노드들은 항상 가장 긴 체인이 옳은 것인지를 확인하고 그것을 계속 연장하기 위해서 힘쓸 것이다. If two nodes…
$0.00
2 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 45
#5. Network #5.네트웍 The steps to run the network are as follows: 네트웍을 운영하는 단계들은 다음과 같다 New transactions are broadcast to all nodes. 새로운 거래들은 모든 노드들에게 널리 알린다. Each…
$0.00
2 0
msss (25)in #bitcoin • 7 years ago
Bitcoin. 백서 44
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…
$0.00
2 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 43
We will show later that the probability of a slower attacker catching up diminishes exponentially as subsequent blocks are added. 우리는 더 느린 공격자가 따라 잡을 확율이 그 다음 블럭들이 더해질 때 지수적으로 줄어드는 것을 나중에 보여줄 것이다.
$0.00
2 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 42
If a majority of CPU power is controlled by honest nodes, the honest chain will grow the fastest and outpace any competing chains. CPU파워의 대다수가 정직한 노드들에 의해 제어된다면, 정직한 체인이 가장 빠르게…
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 41
Proof-of-work is essentially one-CPU-one-vote. 작업증명은 CPU당 하나의 투표가 필수이다. The majority decision is represented by the longest chain, which has the greatest proof-of-work effort…
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 40
The proof-of-work also solves the problem of determining representation in majority decision making. 작업증명은 또한 다수 의사결정의 대표를 결정해야하는 문제가 있다. If the majority were based on…
$0.00
0 1
msss (25)in #bitcoin • 7 years ago
Bitcoin. 백서 39
As later blocks are chained after it, the work to change the block would include redoing all the blocks after it. 그 블럭이후에 더 나중 블럭들이 사슬로 되어지기 때문에, 그 블럭을 변경시키는 작업은 그 블럭이후에 모든 블럭을 다시 만든다는 것을 내포한다.
$0.00
2 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 38
Once the CPU effort has been expended to make it satisfy the proof-of-work, the block cannot be changed without redoing the work. CPU의 노력으로 작업증명을 만족시킬 것으로 기대된다면, 그 블럭은 그 작업을 다시 하지 않고는 변경될 수 없을 것이다.
$0.00
0 0
msss (25)in #bitcoin • 7 years ago
Bitcoin 백서 37
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. 작업증명은 SHA-256과 같이 해시처리된 값을 정밀검사한다는 것을 포함한다.…
$0.00
4 0

msss (25)