Block #1,034,632

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2015, 8:10:16 AM · Difficulty 10.7469 · 5,808,292 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0db8353647b34f9396220ec045eb289232469024ee67f264ed41eeca54ef5159

Height

#1,034,632

Difficulty

10.746938

Transactions

4

Size

1.44 KB

Version

2

Bits

0abf3752

Nonce

1,352,470,469

Timestamp

4/27/2015, 8:10:16 AM

Confirmations

5,808,292

Merkle Root

9a76b4baf6d84d2b03e4c7eaa579aaffa3e8f1662e0cfd09931310e4c896a79b
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.666 × 10⁹⁶(97-digit number)
36667147042457559021…46539567404886025599
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.666 × 10⁹⁶(97-digit number)
36667147042457559021…46539567404886025599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.333 × 10⁹⁶(97-digit number)
73334294084915118043…93079134809772051199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.466 × 10⁹⁷(98-digit number)
14666858816983023608…86158269619544102399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.933 × 10⁹⁷(98-digit number)
29333717633966047217…72316539239088204799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.866 × 10⁹⁷(98-digit number)
58667435267932094435…44633078478176409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.173 × 10⁹⁸(99-digit number)
11733487053586418887…89266156956352819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.346 × 10⁹⁸(99-digit number)
23466974107172837774…78532313912705638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.693 × 10⁹⁸(99-digit number)
46933948214345675548…57064627825411276799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.386 × 10⁹⁸(99-digit number)
93867896428691351096…14129255650822553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.877 × 10⁹⁹(100-digit number)
18773579285738270219…28258511301645107199
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,987,740 XPM·at block #6,842,923 · 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