Block #429,764

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/5/2014, 1:08:01 AM · Difficulty 10.3418 · 6,377,825 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
7eb372a04b407dbce253b10d25846e1380b9b3133ba27ed4dac3e3a1aebc2c7f

Height

#429,764

Difficulty

10.341843

Transactions

5

Size

1.75 KB

Version

2

Bits

0a578302

Nonce

385,032

Timestamp

3/5/2014, 1:08:01 AM

Confirmations

6,377,825

Merkle Root

801127275a429b2602a0177b6b6b07a9ded7113fbe2e4d44013a06dbc56527e6
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

3.568 × 10¹⁰¹(102-digit number)
35681378431508029953…10856099126413145601
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
3.568 × 10¹⁰¹(102-digit number)
35681378431508029953…10856099126413145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.136 × 10¹⁰¹(102-digit number)
71362756863016059907…21712198252826291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.427 × 10¹⁰²(103-digit number)
14272551372603211981…43424396505652582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.854 × 10¹⁰²(103-digit number)
28545102745206423963…86848793011305164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.709 × 10¹⁰²(103-digit number)
57090205490412847926…73697586022610329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.141 × 10¹⁰³(104-digit number)
11418041098082569585…47395172045220659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.283 × 10¹⁰³(104-digit number)
22836082196165139170…94790344090441318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.567 × 10¹⁰³(104-digit number)
45672164392330278340…89580688180882636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.134 × 10¹⁰³(104-digit number)
91344328784660556681…79161376361765273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.826 × 10¹⁰⁴(105-digit number)
18268865756932111336…58322752723530547201
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,704,739 XPM·at block #6,807,588 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy