Block #607,746

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/30/2014, 5:30:11 AM · Difficulty 10.9073 · 6,219,492 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3d0f0311ae599e0698378677775ac108c615ebde11cdeb6dd49ffadf7c5bd293

Height

#607,746

Difficulty

10.907309

Transactions

12

Size

3.90 KB

Version

2

Bits

0ae84561

Nonce

258,944,014

Timestamp

6/30/2014, 5:30:11 AM

Confirmations

6,219,492

Merkle Root

0d35aba3fbee06c204605e5349d450881f677e4e192b3fda27961a83e06dde1a
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.843 × 10⁹⁸(99-digit number)
58439552811553943507…38111268184729180479
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.843 × 10⁹⁸(99-digit number)
58439552811553943507…38111268184729180479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.168 × 10⁹⁹(100-digit number)
11687910562310788701…76222536369458360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.337 × 10⁹⁹(100-digit number)
23375821124621577403…52445072738916721919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.675 × 10⁹⁹(100-digit number)
46751642249243154806…04890145477833443839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.350 × 10⁹⁹(100-digit number)
93503284498486309612…09780290955666887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.870 × 10¹⁰⁰(101-digit number)
18700656899697261922…19560581911333775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.740 × 10¹⁰⁰(101-digit number)
37401313799394523844…39121163822667550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.480 × 10¹⁰⁰(101-digit number)
74802627598789047689…78242327645335101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.496 × 10¹⁰¹(102-digit number)
14960525519757809537…56484655290670202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.992 × 10¹⁰¹(102-digit number)
29921051039515619075…12969310581340405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.984 × 10¹⁰¹(102-digit number)
59842102079031238151…25938621162680811519
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,862,005 XPM·at block #6,827,237 · 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