Block #1,262,863

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/1/2015, 5:36:31 PM · Difficulty 10.8256 · 5,549,659 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d99db1f5582de33def74f3d4151d105a5aec3bf967f730d4b00ad317255dfe13

Height

#1,262,863

Difficulty

10.825608

Transactions

3

Size

651 B

Version

2

Bits

0ad35b05

Nonce

149,109,298

Timestamp

10/1/2015, 5:36:31 PM

Confirmations

5,549,659

Merkle Root

79ef2f22ec104748f4e349c09ba5758ebe4b37631ddcfcf33861c6d36634788a
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.291 × 10⁹⁶(97-digit number)
12914067489955833269…17379379326269962241
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.291 × 10⁹⁶(97-digit number)
12914067489955833269…17379379326269962241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.582 × 10⁹⁶(97-digit number)
25828134979911666538…34758758652539924481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.165 × 10⁹⁶(97-digit number)
51656269959823333076…69517517305079848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.033 × 10⁹⁷(98-digit number)
10331253991964666615…39035034610159697921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.066 × 10⁹⁷(98-digit number)
20662507983929333230…78070069220319395841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.132 × 10⁹⁷(98-digit number)
41325015967858666461…56140138440638791681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.265 × 10⁹⁷(98-digit number)
82650031935717332922…12280276881277583361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.653 × 10⁹⁸(99-digit number)
16530006387143466584…24560553762555166721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.306 × 10⁹⁸(99-digit number)
33060012774286933168…49121107525110333441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.612 × 10⁹⁸(99-digit number)
66120025548573866337…98242215050220666881
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,744,211 XPM·at block #6,812,521 · 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