Block #283,694

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2013, 8:27:22 PM · Difficulty 9.9815 · 6,553,849 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f368e4c6c0b340b41647a54b393c1412789ef0a8c715b96862a265b3e190ff77

Height

#283,694

Difficulty

9.981494

Transactions

1

Size

1.11 KB

Version

2

Bits

09fb4337

Nonce

3,333

Timestamp

11/29/2013, 8:27:22 PM

Confirmations

6,553,849

Merkle Root

9cfb6e85cbd0f46039c7cd52a3e815181602fae6d0dcc715f7346f741299e1f0
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.804 × 10⁹⁶(97-digit number)
88046814016673234354…29937352002039408641
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.804 × 10⁹⁶(97-digit number)
88046814016673234354…29937352002039408641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.760 × 10⁹⁷(98-digit number)
17609362803334646870…59874704004078817281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.521 × 10⁹⁷(98-digit number)
35218725606669293741…19749408008157634561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.043 × 10⁹⁷(98-digit number)
70437451213338587483…39498816016315269121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.408 × 10⁹⁸(99-digit number)
14087490242667717496…78997632032630538241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.817 × 10⁹⁸(99-digit number)
28174980485335434993…57995264065261076481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.634 × 10⁹⁸(99-digit number)
56349960970670869986…15990528130522152961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.126 × 10⁹⁹(100-digit number)
11269992194134173997…31981056261044305921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.253 × 10⁹⁹(100-digit number)
22539984388268347994…63962112522088611841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.507 × 10⁹⁹(100-digit number)
45079968776536695989…27924225044177223681
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,944,671 XPM·at block #6,837,542 · 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