Block #593,802

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/19/2014, 12:28:15 AM · Difficulty 10.9397 · 6,217,132 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8526745abcbfb5549448bc06de444083e980d54eb4ea0e714b91f90ca16586e1

Height

#593,802

Difficulty

10.939676

Transactions

6

Size

13.12 KB

Version

2

Bits

0af08e9f

Nonce

117,979,102

Timestamp

6/19/2014, 12:28:15 AM

Confirmations

6,217,132

Merkle Root

d6fc1c934374e16cb0c2534c94c6549f2406da30128fd421fca1baa9abdd8ddd
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.

2.317 × 10⁹⁷(98-digit number)
23177974423600406476…91575835227323662499
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
2.317 × 10⁹⁷(98-digit number)
23177974423600406476…91575835227323662499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.635 × 10⁹⁷(98-digit number)
46355948847200812953…83151670454647324999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.271 × 10⁹⁷(98-digit number)
92711897694401625907…66303340909294649999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.854 × 10⁹⁸(99-digit number)
18542379538880325181…32606681818589299999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.708 × 10⁹⁸(99-digit number)
37084759077760650363…65213363637178599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.416 × 10⁹⁸(99-digit number)
74169518155521300726…30426727274357199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.483 × 10⁹⁹(100-digit number)
14833903631104260145…60853454548714399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.966 × 10⁹⁹(100-digit number)
29667807262208520290…21706909097428799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.933 × 10⁹⁹(100-digit number)
59335614524417040581…43413818194857599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.186 × 10¹⁰⁰(101-digit number)
11867122904883408116…86827636389715199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.373 × 10¹⁰⁰(101-digit number)
23734245809766816232…73655272779430399999
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,731,576 XPM·at block #6,810,933 · 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