Block #1,262,750

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/1/2015, 3:32:35 PM · Difficulty 10.8259 · 5,563,364 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
658a1980903b7c11ed3953b629abc1a04414fc2d7b8e6774278e5c1076a7d0bf

Height

#1,262,750

Difficulty

10.825933

Transactions

2

Size

1.71 KB

Version

2

Bits

0ad37051

Nonce

1,157,525,811

Timestamp

10/1/2015, 3:32:35 PM

Confirmations

5,563,364

Merkle Root

6feb5463aaef2dadc579a60007806059d3325840097adadebcff81fadba320b2
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.

2.420 × 10⁹⁴(95-digit number)
24206046794503169405…06891772083584878841
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.420 × 10⁹⁴(95-digit number)
24206046794503169405…06891772083584878841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.841 × 10⁹⁴(95-digit number)
48412093589006338811…13783544167169757681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.682 × 10⁹⁴(95-digit number)
96824187178012677623…27567088334339515361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.936 × 10⁹⁵(96-digit number)
19364837435602535524…55134176668679030721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.872 × 10⁹⁵(96-digit number)
38729674871205071049…10268353337358061441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.745 × 10⁹⁵(96-digit number)
77459349742410142098…20536706674716122881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.549 × 10⁹⁶(97-digit number)
15491869948482028419…41073413349432245761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.098 × 10⁹⁶(97-digit number)
30983739896964056839…82146826698864491521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.196 × 10⁹⁶(97-digit number)
61967479793928113678…64293653397728983041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.239 × 10⁹⁷(98-digit number)
12393495958785622735…28587306795457966081
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,853,037 XPM·at block #6,826,113 · 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