Block #574,963

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/3/2014, 4:16:49 PM · Difficulty 10.9679 · 6,251,148 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f9df13b46c1691318ffe4d3cc1d904c05011cb6a0fdfe2ee0e39b333ab0653d1

Height

#574,963

Difficulty

10.967878

Transactions

3

Size

1.33 KB

Version

2

Bits

0af7c6df

Nonce

199,089,399

Timestamp

6/3/2014, 4:16:49 PM

Confirmations

6,251,148

Merkle Root

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

9.953 × 10⁹⁷(98-digit number)
99534709770637872084…34038625629857838401
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.953 × 10⁹⁷(98-digit number)
99534709770637872084…34038625629857838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.990 × 10⁹⁸(99-digit number)
19906941954127574416…68077251259715676801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.981 × 10⁹⁸(99-digit number)
39813883908255148833…36154502519431353601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.962 × 10⁹⁸(99-digit number)
79627767816510297667…72309005038862707201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.592 × 10⁹⁹(100-digit number)
15925553563302059533…44618010077725414401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.185 × 10⁹⁹(100-digit number)
31851107126604119067…89236020155450828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.370 × 10⁹⁹(100-digit number)
63702214253208238134…78472040310901657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.274 × 10¹⁰⁰(101-digit number)
12740442850641647626…56944080621803315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.548 × 10¹⁰⁰(101-digit number)
25480885701283295253…13888161243606630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.096 × 10¹⁰⁰(101-digit number)
50961771402566590507…27776322487213260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.019 × 10¹⁰¹(102-digit number)
10192354280513318101…55552644974426521601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,853,012 XPM·at block #6,826,110 · 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