Block #496,206

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2014, 11:43:01 PM · Difficulty 10.7507 · 6,321,727 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fc65bfde859c4b4942aaa3b0ea52d66b287ba30945ff35c7ff881edf91b64ac8

Height

#496,206

Difficulty

10.750672

Transactions

7

Size

1.67 KB

Version

2

Bits

0ac02c07

Nonce

181,751,468

Timestamp

4/16/2014, 11:43:01 PM

Confirmations

6,321,727

Merkle Root

6d8691092cab67528c262710c82d35480d7e0ae1f4e846374696f43f5bd5d485
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.

4.746 × 10⁹⁷(98-digit number)
47469155725705686595…53408570340981466101
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
4.746 × 10⁹⁷(98-digit number)
47469155725705686595…53408570340981466101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.493 × 10⁹⁷(98-digit number)
94938311451411373191…06817140681962932201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.898 × 10⁹⁸(99-digit number)
18987662290282274638…13634281363925864401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.797 × 10⁹⁸(99-digit number)
37975324580564549276…27268562727851728801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.595 × 10⁹⁸(99-digit number)
75950649161129098553…54537125455703457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.519 × 10⁹⁹(100-digit number)
15190129832225819710…09074250911406915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.038 × 10⁹⁹(100-digit number)
30380259664451639421…18148501822813830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.076 × 10⁹⁹(100-digit number)
60760519328903278842…36297003645627660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.215 × 10¹⁰⁰(101-digit number)
12152103865780655768…72594007291255321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.430 × 10¹⁰⁰(101-digit number)
24304207731561311537…45188014582510643201
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,787,529 XPM·at block #6,817,932 · 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