Block #595,131

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/20/2014, 2:07:23 AM · Difficulty 10.9371 · 6,221,055 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a4d1781c3190c4e1bcc423ccf273b376c1989558f0edb1ddb02f19b1c544755f

Height

#595,131

Difficulty

10.937133

Transactions

6

Size

1.92 KB

Version

2

Bits

0aefe7eb

Nonce

318,107,845

Timestamp

6/20/2014, 2:07:23 AM

Confirmations

6,221,055

Merkle Root

e8590df7a5867aa5ee67657796a9230c3a0519ef97910cd58d532709ea238fa6
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.422 × 10⁹⁸(99-digit number)
44228681373169822985…38807149964405543679
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.422 × 10⁹⁸(99-digit number)
44228681373169822985…38807149964405543679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.845 × 10⁹⁸(99-digit number)
88457362746339645970…77614299928811087359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.769 × 10⁹⁹(100-digit number)
17691472549267929194…55228599857622174719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.538 × 10⁹⁹(100-digit number)
35382945098535858388…10457199715244349439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.076 × 10⁹⁹(100-digit number)
70765890197071716776…20914399430488698879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.415 × 10¹⁰⁰(101-digit number)
14153178039414343355…41828798860977397759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.830 × 10¹⁰⁰(101-digit number)
28306356078828686710…83657597721954795519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.661 × 10¹⁰⁰(101-digit number)
56612712157657373421…67315195443909591039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.132 × 10¹⁰¹(102-digit number)
11322542431531474684…34630390887819182079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.264 × 10¹⁰¹(102-digit number)
22645084863062949368…69260781775638364159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.529 × 10¹⁰¹(102-digit number)
45290169726125898737…38521563551276728319
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,773,612 XPM·at block #6,816,185 · 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