Block #609,693

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/1/2014, 8:33:32 AM · Difficulty 10.9132 · 6,215,528 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ecdca8a87a1d137345d5065bc2663a51c0d57a208c00fedab4113ae5e195aa39

Height

#609,693

Difficulty

10.913175

Transactions

5

Size

1.66 KB

Version

2

Bits

0ae9c5da

Nonce

35,235,172

Timestamp

7/1/2014, 8:33:32 AM

Confirmations

6,215,528

Merkle Root

921191f91e9644fa81703bbdf64647df3cbab3db4ffab785186db6c417fa285b
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.526 × 10¹⁰⁰(101-digit number)
25267395521639349667…53247599481837055999
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.526 × 10¹⁰⁰(101-digit number)
25267395521639349667…53247599481837055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.053 × 10¹⁰⁰(101-digit number)
50534791043278699335…06495198963674111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.010 × 10¹⁰¹(102-digit number)
10106958208655739867…12990397927348223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.021 × 10¹⁰¹(102-digit number)
20213916417311479734…25980795854696447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.042 × 10¹⁰¹(102-digit number)
40427832834622959468…51961591709392895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.085 × 10¹⁰¹(102-digit number)
80855665669245918936…03923183418785791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.617 × 10¹⁰²(103-digit number)
16171133133849183787…07846366837571583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.234 × 10¹⁰²(103-digit number)
32342266267698367574…15692733675143167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.468 × 10¹⁰²(103-digit number)
64684532535396735148…31385467350286335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.293 × 10¹⁰³(104-digit number)
12936906507079347029…62770934700572671999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,845,863 XPM·at block #6,825,220 · 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