Block #603,965

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/27/2014, 10:48:47 AM · Difficulty 10.9111 · 6,203,920 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6edb55d4afdd97eec7416596b21f8307096dacf84d000e359cc9febf07510e53

Height

#603,965

Difficulty

10.911136

Transactions

7

Size

2.11 KB

Version

2

Bits

0ae9403d

Nonce

50,939,650

Timestamp

6/27/2014, 10:48:47 AM

Confirmations

6,203,920

Merkle Root

139aedd93a81227b33c84c369efbf62856983bc4ba9046f5e7f91a039e2255e0
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.

3.591 × 10⁹⁹(100-digit number)
35917370428651608052…62272474099324887039
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
3.591 × 10⁹⁹(100-digit number)
35917370428651608052…62272474099324887039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.183 × 10⁹⁹(100-digit number)
71834740857303216105…24544948198649774079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.436 × 10¹⁰⁰(101-digit number)
14366948171460643221…49089896397299548159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.873 × 10¹⁰⁰(101-digit number)
28733896342921286442…98179792794599096319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.746 × 10¹⁰⁰(101-digit number)
57467792685842572884…96359585589198192639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.149 × 10¹⁰¹(102-digit number)
11493558537168514576…92719171178396385279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.298 × 10¹⁰¹(102-digit number)
22987117074337029153…85438342356792770559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.597 × 10¹⁰¹(102-digit number)
45974234148674058307…70876684713585541119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.194 × 10¹⁰¹(102-digit number)
91948468297348116615…41753369427171082239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.838 × 10¹⁰²(103-digit number)
18389693659469623323…83506738854342164479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.677 × 10¹⁰²(103-digit number)
36779387318939246646…67013477708684328959
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,707,115 XPM·at block #6,807,884 · 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