Block #488,215

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/12/2014, 2:24:39 PM · Difficulty 10.6505 · 6,324,619 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
76876d590285e28e58b4541d543a7b63c5c39f981881de32efe027b607afd978

Height

#488,215

Difficulty

10.650540

Transactions

6

Size

1.45 KB

Version

2

Bits

0aa689cb

Nonce

199,188,180

Timestamp

4/12/2014, 2:24:39 PM

Confirmations

6,324,619

Merkle Root

8df87b6a88b250ce98e5009c4af4e22a6d832b20bdcc62c5b5172ee9b362bc6f
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.602 × 10¹⁰⁰(101-digit number)
26020757476634702476…99588984952191938561
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.602 × 10¹⁰⁰(101-digit number)
26020757476634702476…99588984952191938561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.204 × 10¹⁰⁰(101-digit number)
52041514953269404953…99177969904383877121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.040 × 10¹⁰¹(102-digit number)
10408302990653880990…98355939808767754241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.081 × 10¹⁰¹(102-digit number)
20816605981307761981…96711879617535508481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.163 × 10¹⁰¹(102-digit number)
41633211962615523962…93423759235071016961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.326 × 10¹⁰¹(102-digit number)
83266423925231047925…86847518470142033921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.665 × 10¹⁰²(103-digit number)
16653284785046209585…73695036940284067841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.330 × 10¹⁰²(103-digit number)
33306569570092419170…47390073880568135681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.661 × 10¹⁰²(103-digit number)
66613139140184838340…94780147761136271361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.332 × 10¹⁰³(104-digit number)
13322627828036967668…89560295522272542721
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,746,716 XPM·at block #6,812,833 · 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