Block #290,564

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 6:25:16 PM · Difficulty 9.9893 · 6,518,063 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4aad80697eed7289a74c380e42820ed3d981d8f3f84025eac552be45984121e0

Height

#290,564

Difficulty

9.989288

Transactions

1

Size

1.05 KB

Version

2

Bits

09fd4202

Nonce

9,333

Timestamp

12/2/2013, 6:25:16 PM

Confirmations

6,518,063

Merkle Root

5d163f21a90b1ffbde9622b72d994702a95f0f77d2b866ef2298a32b32ba1ddc
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.

2.430 × 10¹⁰⁴(105-digit number)
24304409922355758363…61749673785787919361
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
2.430 × 10¹⁰⁴(105-digit number)
24304409922355758363…61749673785787919361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.860 × 10¹⁰⁴(105-digit number)
48608819844711516727…23499347571575838721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.721 × 10¹⁰⁴(105-digit number)
97217639689423033454…46998695143151677441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.944 × 10¹⁰⁵(106-digit number)
19443527937884606690…93997390286303354881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.888 × 10¹⁰⁵(106-digit number)
38887055875769213381…87994780572606709761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.777 × 10¹⁰⁵(106-digit number)
77774111751538426763…75989561145213419521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.555 × 10¹⁰⁶(107-digit number)
15554822350307685352…51979122290426839041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.110 × 10¹⁰⁶(107-digit number)
31109644700615370705…03958244580853678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.221 × 10¹⁰⁶(107-digit number)
62219289401230741410…07916489161707356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.244 × 10¹⁰⁷(108-digit number)
12443857880246148282…15832978323414712321
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,713,066 XPM·at block #6,808,626 · 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.

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