Block #423,677

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 2:21:40 PM · Difficulty 10.3785 · 6,393,797 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
58cc0bf84ca3773f43b405d7467e3443696219455bb55dd13f7f8b38eca56386

Height

#423,677

Difficulty

10.378528

Transactions

3

Size

706 B

Version

2

Bits

0a60e73c

Nonce

5,384

Timestamp

2/28/2014, 2:21:40 PM

Confirmations

6,393,797

Merkle Root

476b9ccdef1282c96470508b5d88776309b09342ae61521cfa2d8974ae510493
Transactions (3)
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.

6.000 × 10⁹⁹(100-digit number)
60008507071875197201…41838616127445706081
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
6.000 × 10⁹⁹(100-digit number)
60008507071875197201…41838616127445706081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.200 × 10¹⁰⁰(101-digit number)
12001701414375039440…83677232254891412161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.400 × 10¹⁰⁰(101-digit number)
24003402828750078880…67354464509782824321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.800 × 10¹⁰⁰(101-digit number)
48006805657500157761…34708929019565648641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.601 × 10¹⁰⁰(101-digit number)
96013611315000315522…69417858039131297281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.920 × 10¹⁰¹(102-digit number)
19202722263000063104…38835716078262594561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.840 × 10¹⁰¹(102-digit number)
38405444526000126209…77671432156525189121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.681 × 10¹⁰¹(102-digit number)
76810889052000252418…55342864313050378241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.536 × 10¹⁰²(103-digit number)
15362177810400050483…10685728626100756481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.072 × 10¹⁰²(103-digit number)
30724355620800100967…21371457252201512961
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,783,844 XPM·at block #6,817,473 · 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.
Privacy Policy·

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