Block #556,345

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/22/2014, 5:06:13 AM · Difficulty 10.9627 · 6,253,248 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1330c649e4705c522d1ebd2590cbfe77d98cc3e65fee0a513d0757ac32954edb

Height

#556,345

Difficulty

10.962722

Transactions

8

Size

2.76 KB

Version

2

Bits

0af674f6

Nonce

464,119,230

Timestamp

5/22/2014, 5:06:13 AM

Confirmations

6,253,248

Merkle Root

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

1.033 × 10¹⁰¹(102-digit number)
10330744966033190952…42716416633285888001
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
1.033 × 10¹⁰¹(102-digit number)
10330744966033190952…42716416633285888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.066 × 10¹⁰¹(102-digit number)
20661489932066381905…85432833266571776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.132 × 10¹⁰¹(102-digit number)
41322979864132763810…70865666533143552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.264 × 10¹⁰¹(102-digit number)
82645959728265527621…41731333066287104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.652 × 10¹⁰²(103-digit number)
16529191945653105524…83462666132574208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.305 × 10¹⁰²(103-digit number)
33058383891306211048…66925332265148416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.611 × 10¹⁰²(103-digit number)
66116767782612422097…33850664530296832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.322 × 10¹⁰³(104-digit number)
13223353556522484419…67701329060593664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.644 × 10¹⁰³(104-digit number)
26446707113044968838…35402658121187328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.289 × 10¹⁰³(104-digit number)
52893414226089937677…70805316242374656001
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,720,817 XPM·at block #6,809,592 · 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