Block #588,640

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/14/2014, 8:00:23 PM · Difficulty 10.9490 · 6,226,411 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
51ecbafe75ec6bf2a9596827eac5e98599ea84259f57cf2beed16c1fa72d3dd6

Height

#588,640

Difficulty

10.949028

Transactions

5

Size

2.06 KB

Version

2

Bits

0af2f387

Nonce

441,708,769

Timestamp

6/14/2014, 8:00:23 PM

Confirmations

6,226,411

Merkle Root

d278469e5d1a923c59e2d3418c968666a32c8d99926891abdeb6b11cfb2b4d1f
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.264 × 10⁹⁷(98-digit number)
12645022701776442298…94083203359679848939
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.264 × 10⁹⁷(98-digit number)
12645022701776442298…94083203359679848939
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.529 × 10⁹⁷(98-digit number)
25290045403552884596…88166406719359697879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.058 × 10⁹⁷(98-digit number)
50580090807105769192…76332813438719395759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.011 × 10⁹⁸(99-digit number)
10116018161421153838…52665626877438791519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.023 × 10⁹⁸(99-digit number)
20232036322842307676…05331253754877583039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.046 × 10⁹⁸(99-digit number)
40464072645684615353…10662507509755166079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.092 × 10⁹⁸(99-digit number)
80928145291369230707…21325015019510332159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.618 × 10⁹⁹(100-digit number)
16185629058273846141…42650030039020664319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.237 × 10⁹⁹(100-digit number)
32371258116547692283…85300060078041328639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.474 × 10⁹⁹(100-digit number)
64742516233095384566…70600120156082657279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.294 × 10¹⁰⁰(101-digit number)
12948503246619076913…41200240312165314559
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,764,499 XPM·at block #6,815,050 · 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