Block #1,310,500

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/3/2015, 8:13:51 AM · Difficulty 10.8491 · 5,506,756 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bf0327d0275018661717fb0122dc73bdea5564b585e14e6a8eabbff77e3a41d2

Height

#1,310,500

Difficulty

10.849139

Transactions

3

Size

14.09 KB

Version

2

Bits

0ad9612d

Nonce

199,777,187

Timestamp

11/3/2015, 8:13:51 AM

Confirmations

5,506,756

Merkle Root

d3602b5f756c28e9583ea7da2ffa2731908b951e5db8ecf4ca1619bc145d9675
Transactions (3)
1 in → 1 out8.6300 XPM110 B
93 in → 1 out297.0626 XPM13.50 KB
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.034 × 10⁹⁴(95-digit number)
20345788472800838771…62942619577161057281
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.034 × 10⁹⁴(95-digit number)
20345788472800838771…62942619577161057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.069 × 10⁹⁴(95-digit number)
40691576945601677542…25885239154322114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.138 × 10⁹⁴(95-digit number)
81383153891203355085…51770478308644229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.627 × 10⁹⁵(96-digit number)
16276630778240671017…03540956617288458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.255 × 10⁹⁵(96-digit number)
32553261556481342034…07081913234576916481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.510 × 10⁹⁵(96-digit number)
65106523112962684068…14163826469153832961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.302 × 10⁹⁶(97-digit number)
13021304622592536813…28327652938307665921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.604 × 10⁹⁶(97-digit number)
26042609245185073627…56655305876615331841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.208 × 10⁹⁶(97-digit number)
52085218490370147254…13310611753230663681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.041 × 10⁹⁷(98-digit number)
10417043698074029450…26621223506461327361
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,782,083 XPM·at block #6,817,255 · 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