Block #492,293

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 12:54:21 AM · Difficulty 10.6885 · 6,322,022 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
97b1a08d0f6f4e208fb361c4422f1edb3b14b8d782b319770d7bc1effd268646

Height

#492,293

Difficulty

10.688522

Transactions

1

Size

867 B

Version

2

Bits

0ab042f2

Nonce

24,483

Timestamp

4/15/2014, 12:54:21 AM

Confirmations

6,322,022

Merkle Root

ed4c0351d22337ad79a58c7046039db1ca614b3036ee652be6c38945e389ec59
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.946 × 10⁹⁵(96-digit number)
89460535057353652727…47932235714873168001
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.946 × 10⁹⁵(96-digit number)
89460535057353652727…47932235714873168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.789 × 10⁹⁶(97-digit number)
17892107011470730545…95864471429746336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.578 × 10⁹⁶(97-digit number)
35784214022941461091…91728942859492672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.156 × 10⁹⁶(97-digit number)
71568428045882922182…83457885718985344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.431 × 10⁹⁷(98-digit number)
14313685609176584436…66915771437970688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.862 × 10⁹⁷(98-digit number)
28627371218353168872…33831542875941376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.725 × 10⁹⁷(98-digit number)
57254742436706337745…67663085751882752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.145 × 10⁹⁸(99-digit number)
11450948487341267549…35326171503765504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.290 × 10⁹⁸(99-digit number)
22901896974682535098…70652343007531008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.580 × 10⁹⁸(99-digit number)
45803793949365070196…41304686015062016001
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,758,583 XPM·at block #6,814,314 · 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