Block #2,269,755

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/27/2017, 4:12:17 AM · Difficulty 10.9525 · 4,568,348 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0006d76426c8e4e7dd7f6fb63fe57b22fe6ffbf4557ebc761950d8e50e84bf3e

Height

#2,269,755

Difficulty

10.952456

Transactions

2

Size

424 B

Version

2

Bits

0af3d424

Nonce

264,489,454

Timestamp

8/27/2017, 4:12:17 AM

Confirmations

4,568,348

Merkle Root

ff3f7302752e63f18e5a149ef6175f828611b708d6fb132b674ef63467cb2905
Transactions (2)
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.

4.118 × 10⁹⁰(91-digit number)
41180083101995865043…45133143384712131299
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
4.118 × 10⁹⁰(91-digit number)
41180083101995865043…45133143384712131299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.236 × 10⁹⁰(91-digit number)
82360166203991730086…90266286769424262599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.647 × 10⁹¹(92-digit number)
16472033240798346017…80532573538848525199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.294 × 10⁹¹(92-digit number)
32944066481596692034…61065147077697050399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.588 × 10⁹¹(92-digit number)
65888132963193384069…22130294155394100799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.317 × 10⁹²(93-digit number)
13177626592638676813…44260588310788201599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.635 × 10⁹²(93-digit number)
26355253185277353627…88521176621576403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.271 × 10⁹²(93-digit number)
52710506370554707255…77042353243152806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.054 × 10⁹³(94-digit number)
10542101274110941451…54084706486305612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.108 × 10⁹³(94-digit number)
21084202548221882902…08169412972611225599
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,949,177 XPM·at block #6,838,102 · 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