Block #2,235,969

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/4/2017, 2:19:53 AM · Difficulty 10.9458 · 4,605,994 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
27a1e62d5d256e4ac90920955403f5a31d099256ffd52f31e7b2297c0e83663b

Height

#2,235,969

Difficulty

10.945849

Transactions

7

Size

1.53 KB

Version

2

Bits

0af2232e

Nonce

36,284,320

Timestamp

8/4/2017, 2:19:53 AM

Confirmations

4,605,994

Merkle Root

522f03ed8c788d268ff2004118a843a597734b6753da8b9e98c4318fa06f05e0
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.

4.721 × 10⁹⁵(96-digit number)
47219996247598053161…33594932743577052801
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
4.721 × 10⁹⁵(96-digit number)
47219996247598053161…33594932743577052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.443 × 10⁹⁵(96-digit number)
94439992495196106322…67189865487154105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.888 × 10⁹⁶(97-digit number)
18887998499039221264…34379730974308211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.777 × 10⁹⁶(97-digit number)
37775996998078442529…68759461948616422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.555 × 10⁹⁶(97-digit number)
75551993996156885058…37518923897232844801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.511 × 10⁹⁷(98-digit number)
15110398799231377011…75037847794465689601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.022 × 10⁹⁷(98-digit number)
30220797598462754023…50075695588931379201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.044 × 10⁹⁷(98-digit number)
60441595196925508046…00151391177862758401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.208 × 10⁹⁸(99-digit number)
12088319039385101609…00302782355725516801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.417 × 10⁹⁸(99-digit number)
24176638078770203218…00605564711451033601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.835 × 10⁹⁸(99-digit number)
48353276157540406437…01211129422902067201
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,980,086 XPM·at block #6,841,962 · 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