Block #289,902

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 10:31:37 AM · Difficulty 9.9889 · 6,523,951 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6f716229fb18ee089bf0d44c60c7f139fd02426aac9688f3b229c6e221040362

Height

#289,902

Difficulty

9.988856

Transactions

13

Size

3.42 KB

Version

2

Bits

09fd25a9

Nonce

86,985

Timestamp

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

Confirmations

6,523,951

Merkle Root

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

8.545 × 10⁹²(93-digit number)
85458832108813868037…30251078679792629761
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
8.545 × 10⁹²(93-digit number)
85458832108813868037…30251078679792629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.709 × 10⁹³(94-digit number)
17091766421762773607…60502157359585259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.418 × 10⁹³(94-digit number)
34183532843525547214…21004314719170519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.836 × 10⁹³(94-digit number)
68367065687051094429…42008629438341038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.367 × 10⁹⁴(95-digit number)
13673413137410218885…84017258876682076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.734 × 10⁹⁴(95-digit number)
27346826274820437771…68034517753364152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.469 × 10⁹⁴(95-digit number)
54693652549640875543…36069035506728304641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.093 × 10⁹⁵(96-digit number)
10938730509928175108…72138071013456609281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.187 × 10⁹⁵(96-digit number)
21877461019856350217…44276142026913218561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.375 × 10⁹⁵(96-digit number)
43754922039712700435…88552284053826437121
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,754,895 XPM·at block #6,813,852 · 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