Block #1,289,979

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/20/2015, 2:03:07 PM · Difficulty 10.8255 · 5,552,188 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aa72f538c44f4f7e346565d08704fef9520846b44352bbdb096a19e969b92dc4

Height

#1,289,979

Difficulty

10.825459

Transactions

34

Size

9.76 KB

Version

2

Bits

0ad3514c

Nonce

681,237,391

Timestamp

10/20/2015, 2:03:07 PM

Confirmations

5,552,188

Merkle Root

06a92e023606efc99fa7ecea0e392418695cc509ee62a3a0b8d81dd4083c4066
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.999 × 10⁹⁵(96-digit number)
29991448912509532354…01127436017206776641
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.999 × 10⁹⁵(96-digit number)
29991448912509532354…01127436017206776641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.998 × 10⁹⁵(96-digit number)
59982897825019064709…02254872034413553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.199 × 10⁹⁶(97-digit number)
11996579565003812941…04509744068827106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.399 × 10⁹⁶(97-digit number)
23993159130007625883…09019488137654213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.798 × 10⁹⁶(97-digit number)
47986318260015251767…18038976275308426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.597 × 10⁹⁶(97-digit number)
95972636520030503535…36077952550616852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.919 × 10⁹⁷(98-digit number)
19194527304006100707…72155905101233704961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.838 × 10⁹⁷(98-digit number)
38389054608012201414…44311810202467409921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.677 × 10⁹⁷(98-digit number)
76778109216024402828…88623620404934819841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.535 × 10⁹⁸(99-digit number)
15355621843204880565…77247240809869639681
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,981,727 XPM·at block #6,842,166 · 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