Block #433,963

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2014, 10:48:17 PM · Difficulty 10.3462 · 6,373,745 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c2a54f65a1dacdef291f2902c928f403cb1cf68068b8e8bd02fc15a9b5496748

Height

#433,963

Difficulty

10.346231

Transactions

2

Size

544 B

Version

2

Bits

0a58a297

Nonce

955

Timestamp

3/7/2014, 10:48:17 PM

Confirmations

6,373,745

Merkle Root

df6d57a8a1ff099d35b3848efda36bff2801b331c8d000bb4923d101244b0557
Transactions (2)
1 in → 1 out9.3490 XPM110 B
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.476 × 10¹⁰⁵(106-digit number)
14769180855148765328…45889680965907886081
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.476 × 10¹⁰⁵(106-digit number)
14769180855148765328…45889680965907886081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.953 × 10¹⁰⁵(106-digit number)
29538361710297530657…91779361931815772161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.907 × 10¹⁰⁵(106-digit number)
59076723420595061314…83558723863631544321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.181 × 10¹⁰⁶(107-digit number)
11815344684119012262…67117447727263088641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.363 × 10¹⁰⁶(107-digit number)
23630689368238024525…34234895454526177281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.726 × 10¹⁰⁶(107-digit number)
47261378736476049051…68469790909052354561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.452 × 10¹⁰⁶(107-digit number)
94522757472952098103…36939581818104709121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.890 × 10¹⁰⁷(108-digit number)
18904551494590419620…73879163636209418241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.780 × 10¹⁰⁷(108-digit number)
37809102989180839241…47758327272418836481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.561 × 10¹⁰⁷(108-digit number)
75618205978361678482…95516654544837672961
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,705,695 XPM·at block #6,807,707 · 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