Block #488,715

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/12/2014, 8:39:52 PM · Difficulty 10.6595 · 6,338,228 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
36cf8c2bbb9ffbb529db8a5c3ad0a8f90f07e466e3c8eadf91ecf809219b2769

Height

#488,715

Difficulty

10.659524

Transactions

7

Size

1.52 KB

Version

2

Bits

0aa8d691

Nonce

21,818

Timestamp

4/12/2014, 8:39:52 PM

Confirmations

6,338,228

Merkle Root

24b1050d7a90af9ad0cae4b07d22a10d0b01ebf36c113f3a4e7b4f43908616dd
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.254 × 10⁹⁸(99-digit number)
22541836394889074826…31231454671299518661
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.254 × 10⁹⁸(99-digit number)
22541836394889074826…31231454671299518661
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.508 × 10⁹⁸(99-digit number)
45083672789778149652…62462909342599037321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.016 × 10⁹⁸(99-digit number)
90167345579556299304…24925818685198074641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.803 × 10⁹⁹(100-digit number)
18033469115911259860…49851637370396149281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.606 × 10⁹⁹(100-digit number)
36066938231822519721…99703274740792298561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.213 × 10⁹⁹(100-digit number)
72133876463645039443…99406549481584597121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.442 × 10¹⁰⁰(101-digit number)
14426775292729007888…98813098963169194241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.885 × 10¹⁰⁰(101-digit number)
28853550585458015777…97626197926338388481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.770 × 10¹⁰⁰(101-digit number)
57707101170916031554…95252395852676776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.154 × 10¹⁰¹(102-digit number)
11541420234183206310…90504791705353553921
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,859,718 XPM·at block #6,826,942 · 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