Block #1,102,552

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/13/2015, 9:03:59 AM · Difficulty 10.7584 · 5,706,854 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d3b85736d3c6c67d9563947b8da0a243dcbda3944da9dd88ade1bdf903bc72d9

Height

#1,102,552

Difficulty

10.758431

Transactions

9

Size

21.03 KB

Version

2

Bits

0ac2288e

Nonce

1,599,700,129

Timestamp

6/13/2015, 9:03:59 AM

Confirmations

5,706,854

Merkle Root

6c5b436539b6fdcbb63979d4bfaea10ffd4f079a1570867460c40951f8f3ef15
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.512 × 10⁹⁴(95-digit number)
25122465735294231822…11731447867055302081
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.512 × 10⁹⁴(95-digit number)
25122465735294231822…11731447867055302081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.024 × 10⁹⁴(95-digit number)
50244931470588463644…23462895734110604161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.004 × 10⁹⁵(96-digit number)
10048986294117692728…46925791468221208321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.009 × 10⁹⁵(96-digit number)
20097972588235385457…93851582936442416641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.019 × 10⁹⁵(96-digit number)
40195945176470770915…87703165872884833281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.039 × 10⁹⁵(96-digit number)
80391890352941541830…75406331745769666561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.607 × 10⁹⁶(97-digit number)
16078378070588308366…50812663491539333121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.215 × 10⁹⁶(97-digit number)
32156756141176616732…01625326983078666241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.431 × 10⁹⁶(97-digit number)
64313512282353233464…03250653966157332481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.286 × 10⁹⁷(98-digit number)
12862702456470646692…06501307932314664961
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,719,322 XPM·at block #6,809,405 · 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