Block #423,737

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 3:26:26 PM · Difficulty 10.3791 · 6,385,108 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2f61789cf1e3b51d6ae4943f4af1552fb9f9c23a6a14c52a511f6825106b6397

Height

#423,737

Difficulty

10.379145

Transactions

2

Size

1.25 KB

Version

2

Bits

0a610fa1

Nonce

43,106

Timestamp

2/28/2014, 3:26:26 PM

Confirmations

6,385,108

Merkle Root

0a4e26ee56baba3d486e1d2f3593b691b051328dc9e9e30897a6c714693f6ed9
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.

9.895 × 10⁹³(94-digit number)
98954581907471139276…62134431756122931041
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
9.895 × 10⁹³(94-digit number)
98954581907471139276…62134431756122931041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.979 × 10⁹⁴(95-digit number)
19790916381494227855…24268863512245862081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.958 × 10⁹⁴(95-digit number)
39581832762988455710…48537727024491724161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.916 × 10⁹⁴(95-digit number)
79163665525976911421…97075454048983448321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.583 × 10⁹⁵(96-digit number)
15832733105195382284…94150908097966896641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.166 × 10⁹⁵(96-digit number)
31665466210390764568…88301816195933793281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.333 × 10⁹⁵(96-digit number)
63330932420781529137…76603632391867586561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.266 × 10⁹⁶(97-digit number)
12666186484156305827…53207264783735173121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.533 × 10⁹⁶(97-digit number)
25332372968312611654…06414529567470346241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.066 × 10⁹⁶(97-digit number)
50664745936625223309…12829059134940692481
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,714,808 XPM·at block #6,808,844 · 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