Block #603,734

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/27/2014, 7:07:44 AM · Difficulty 10.9110 · 6,207,182 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
772a428734f1c3fff25674fe5f4c4101e7e2332fc9fc4e2eb12c82fe798090f1

Height

#603,734

Difficulty

10.910975

Transactions

7

Size

3.41 KB

Version

2

Bits

0ae935a2

Nonce

25,035,147

Timestamp

6/27/2014, 7:07:44 AM

Confirmations

6,207,182

Merkle Root

2203fc1d73fe6c8f745deea4f693262f4c698edc6654f2dbb441bddde5dfc796
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.

5.183 × 10⁹⁷(98-digit number)
51839371944709491398…10189555038785519999
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
5.183 × 10⁹⁷(98-digit number)
51839371944709491398…10189555038785519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.036 × 10⁹⁸(99-digit number)
10367874388941898279…20379110077571039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.073 × 10⁹⁸(99-digit number)
20735748777883796559…40758220155142079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.147 × 10⁹⁸(99-digit number)
41471497555767593118…81516440310284159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.294 × 10⁹⁸(99-digit number)
82942995111535186237…63032880620568319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.658 × 10⁹⁹(100-digit number)
16588599022307037247…26065761241136639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.317 × 10⁹⁹(100-digit number)
33177198044614074494…52131522482273279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.635 × 10⁹⁹(100-digit number)
66354396089228148989…04263044964546559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.327 × 10¹⁰⁰(101-digit number)
13270879217845629797…08526089929093119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.654 × 10¹⁰⁰(101-digit number)
26541758435691259595…17052179858186239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.308 × 10¹⁰⁰(101-digit number)
53083516871382519191…34104359716372479999
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,429 XPM·at block #6,810,915 · 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