Block #1,253,055

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/25/2015, 2:40:36 PM · Difficulty 10.7873 · 5,556,401 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
180ff9c3f607d44bd216b951531f23641f44be4a5aaf9e971d8f2d22bd9668bf

Height

#1,253,055

Difficulty

10.787344

Transactions

4

Size

1.00 KB

Version

2

Bits

0ac98f5e

Nonce

19,792,118

Timestamp

9/25/2015, 2:40:36 PM

Confirmations

5,556,401

Merkle Root

4b23304d682eb67bb960ac14dd9e877dd206faa64e2b1c7270b40898dcb5e1e8
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.

1.989 × 10⁹³(94-digit number)
19891480245055549352…61610604439606991321
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
1.989 × 10⁹³(94-digit number)
19891480245055549352…61610604439606991321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.978 × 10⁹³(94-digit number)
39782960490111098705…23221208879213982641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.956 × 10⁹³(94-digit number)
79565920980222197411…46442417758427965281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.591 × 10⁹⁴(95-digit number)
15913184196044439482…92884835516855930561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.182 × 10⁹⁴(95-digit number)
31826368392088878964…85769671033711861121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.365 × 10⁹⁴(95-digit number)
63652736784177757929…71539342067423722241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.273 × 10⁹⁵(96-digit number)
12730547356835551585…43078684134847444481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.546 × 10⁹⁵(96-digit number)
25461094713671103171…86157368269694888961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.092 × 10⁹⁵(96-digit number)
50922189427342206343…72314736539389777921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.018 × 10⁹⁶(97-digit number)
10184437885468441268…44629473078779555841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.036 × 10⁹⁶(97-digit number)
20368875770936882537…89258946157559111681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,719,719 XPM·at block #6,809,455 · 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.

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