Block #289,912

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 10:37:16 AM · Difficulty 9.9889 · 6,525,037 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d4be7716bdc2d9a56d9ca79a5bd5507858181f3bf99b875fabc8c691f87fe0e1

Height

#289,912

Difficulty

9.988865

Transactions

6

Size

2.51 KB

Version

2

Bits

09fd263d

Nonce

27,646

Timestamp

12/2/2013, 10:37:16 AM

Confirmations

6,525,037

Merkle Root

6a5e1a0ecb19b91f22e665cdeec1faa6836bc94947d04874786e495ed5eb656b
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.718 × 10⁹⁴(95-digit number)
17186347434384733725…05543242302534933601
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.718 × 10⁹⁴(95-digit number)
17186347434384733725…05543242302534933601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.437 × 10⁹⁴(95-digit number)
34372694868769467451…11086484605069867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.874 × 10⁹⁴(95-digit number)
68745389737538934902…22172969210139734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.374 × 10⁹⁵(96-digit number)
13749077947507786980…44345938420279468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.749 × 10⁹⁵(96-digit number)
27498155895015573960…88691876840558937601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.499 × 10⁹⁵(96-digit number)
54996311790031147921…77383753681117875201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.099 × 10⁹⁶(97-digit number)
10999262358006229584…54767507362235750401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.199 × 10⁹⁶(97-digit number)
21998524716012459168…09535014724471500801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.399 × 10⁹⁶(97-digit number)
43997049432024918337…19070029448943001601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.799 × 10⁹⁶(97-digit number)
87994098864049836674…38140058897886003201
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,763,689 XPM·at block #6,814,948 · 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