Block #599,993

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/24/2014, 1:52:29 AM · Difficulty 10.9253 · 6,226,764 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9dfdc7fbcc392f74401806cb7b63e96662ff94b2a1b0a063aae94afc6c4040ea

Height

#599,993

Difficulty

10.925299

Transactions

3

Size

956 B

Version

2

Bits

0aece06d

Nonce

604,688,851

Timestamp

6/24/2014, 1:52:29 AM

Confirmations

6,226,764

Merkle Root

9f9d703d43e85a0ae23483cec815e09e906f9a4ab1e64a85502c4b4c0e7230d2
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.

4.770 × 10⁹⁹(100-digit number)
47706387019876243894…47671673640484863999
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
4.770 × 10⁹⁹(100-digit number)
47706387019876243894…47671673640484863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.541 × 10⁹⁹(100-digit number)
95412774039752487788…95343347280969727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.908 × 10¹⁰⁰(101-digit number)
19082554807950497557…90686694561939455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.816 × 10¹⁰⁰(101-digit number)
38165109615900995115…81373389123878911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.633 × 10¹⁰⁰(101-digit number)
76330219231801990230…62746778247757823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.526 × 10¹⁰¹(102-digit number)
15266043846360398046…25493556495515647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.053 × 10¹⁰¹(102-digit number)
30532087692720796092…50987112991031295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.106 × 10¹⁰¹(102-digit number)
61064175385441592184…01974225982062591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.221 × 10¹⁰²(103-digit number)
12212835077088318436…03948451964125183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.442 × 10¹⁰²(103-digit number)
24425670154176636873…07896903928250367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.885 × 10¹⁰²(103-digit number)
48851340308353273747…15793807856500735999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,858,214 XPM·at block #6,826,756 · 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