Block #190,011

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/2/2013, 4:51:02 AM · Difficulty 9.8739 · 6,624,378 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1503411623c1708af0f19f250a349a478ba1fbd122c7c504d7656ecafd3c0fac

Height

#190,011

Difficulty

9.873931

Transactions

6

Size

2.17 KB

Version

2

Bits

09dfb9ec

Nonce

21,809

Timestamp

10/2/2013, 4:51:02 AM

Confirmations

6,624,378

Merkle Root

798a6bb72831054aae09d52b43e4b5a9a98d975f1493d8811507fad10c1945fa
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.562 × 10⁹³(94-digit number)
15621527233036647323…38214002361362204801
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.562 × 10⁹³(94-digit number)
15621527233036647323…38214002361362204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.124 × 10⁹³(94-digit number)
31243054466073294647…76428004722724409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.248 × 10⁹³(94-digit number)
62486108932146589294…52856009445448819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.249 × 10⁹⁴(95-digit number)
12497221786429317858…05712018890897638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.499 × 10⁹⁴(95-digit number)
24994443572858635717…11424037781795276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.998 × 10⁹⁴(95-digit number)
49988887145717271435…22848075563590553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.997 × 10⁹⁴(95-digit number)
99977774291434542871…45696151127181107201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.999 × 10⁹⁵(96-digit number)
19995554858286908574…91392302254362214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.999 × 10⁹⁵(96-digit number)
39991109716573817148…82784604508724428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.998 × 10⁹⁵(96-digit number)
79982219433147634297…65569209017448857601
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,759,173 XPM·at block #6,814,388 · 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