Block #1,872,269

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/30/2016, 11:07:06 AM · Difficulty 10.6732 · 4,960,884 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e9abcc28e9a835819fc7503f43fcf2875e761cb15a31056a03136f70683bb91

Height

#1,872,269

Difficulty

10.673207

Transactions

2

Size

723 B

Version

2

Bits

0aac5744

Nonce

2,094,647,794

Timestamp

11/30/2016, 11:07:06 AM

Confirmations

4,960,884

Merkle Root

d036d07e622a8e4c8f1ded41d4d0b8ed1f3e6d848491763d75b008b970ddc272
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.

7.612 × 10⁹⁴(95-digit number)
76120357744654333994…69001918559103729521
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
7.612 × 10⁹⁴(95-digit number)
76120357744654333994…69001918559103729521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.522 × 10⁹⁵(96-digit number)
15224071548930866798…38003837118207459041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.044 × 10⁹⁵(96-digit number)
30448143097861733597…76007674236414918081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.089 × 10⁹⁵(96-digit number)
60896286195723467195…52015348472829836161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.217 × 10⁹⁶(97-digit number)
12179257239144693439…04030696945659672321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.435 × 10⁹⁶(97-digit number)
24358514478289386878…08061393891319344641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.871 × 10⁹⁶(97-digit number)
48717028956578773756…16122787782638689281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.743 × 10⁹⁶(97-digit number)
97434057913157547513…32245575565277378561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.948 × 10⁹⁷(98-digit number)
19486811582631509502…64491151130554757121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.897 × 10⁹⁷(98-digit number)
38973623165263019005…28982302261109514241
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,909,402 XPM·at block #6,833,152 · 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