Block #2,202,170

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/11/2017, 8:04:46 AM · Difficulty 10.9492 · 4,635,610 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6060e1e9a0331cd91a1d686a766762f8197dcb90b49082ec887e5f7e64fb2930

Height

#2,202,170

Difficulty

10.949191

Transactions

4

Size

2.41 KB

Version

2

Bits

0af2fe2a

Nonce

557,632,174

Timestamp

7/11/2017, 8:04:46 AM

Confirmations

4,635,610

Merkle Root

d9478aaa63575eb833c28a1182eee475d9231b2fd292ae9fa0a16c918bab9dda
Transactions (4)
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.351 × 10⁹⁵(96-digit number)
23511381063145070066…83554803843492220841
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.351 × 10⁹⁵(96-digit number)
23511381063145070066…83554803843492220841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.702 × 10⁹⁵(96-digit number)
47022762126290140132…67109607686984441681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.404 × 10⁹⁵(96-digit number)
94045524252580280264…34219215373968883361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.880 × 10⁹⁶(97-digit number)
18809104850516056052…68438430747937766721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.761 × 10⁹⁶(97-digit number)
37618209701032112105…36876861495875533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.523 × 10⁹⁶(97-digit number)
75236419402064224211…73753722991751066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.504 × 10⁹⁷(98-digit number)
15047283880412844842…47507445983502133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.009 × 10⁹⁷(98-digit number)
30094567760825689684…95014891967004267521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.018 × 10⁹⁷(98-digit number)
60189135521651379369…90029783934008535041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.203 × 10⁹⁸(99-digit number)
12037827104330275873…80059567868017070081
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,946,576 XPM·at block #6,837,779 · 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