Block #2,100,442

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/5/2017, 5:24:10 AM · Difficulty 10.8551 · 4,742,129 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b4d5f1bde0164d306485196dc7b728649ecc5b679bbe01415ff4372420f6539d

Height

#2,100,442

Difficulty

10.855097

Transactions

2

Size

574 B

Version

2

Bits

0adae79d

Nonce

201,249,879

Timestamp

5/5/2017, 5:24:10 AM

Confirmations

4,742,129

Merkle Root

030b9f7dfdd5b2f273cde6ef2d582c30f2aadebbcc3420d92ee3c0500a6e605e
Transactions (2)
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.115 × 10⁹³(94-digit number)
11156296616257666090…65824921382780971681
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.115 × 10⁹³(94-digit number)
11156296616257666090…65824921382780971681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.231 × 10⁹³(94-digit number)
22312593232515332180…31649842765561943361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.462 × 10⁹³(94-digit number)
44625186465030664361…63299685531123886721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.925 × 10⁹³(94-digit number)
89250372930061328722…26599371062247773441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.785 × 10⁹⁴(95-digit number)
17850074586012265744…53198742124495546881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.570 × 10⁹⁴(95-digit number)
35700149172024531489…06397484248991093761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.140 × 10⁹⁴(95-digit number)
71400298344049062978…12794968497982187521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.428 × 10⁹⁵(96-digit number)
14280059668809812595…25589936995964375041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.856 × 10⁹⁵(96-digit number)
28560119337619625191…51179873991928750081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.712 × 10⁹⁵(96-digit number)
57120238675239250382…02359747983857500161
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,984,995 XPM·at block #6,842,570 · 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