Block #495,722

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2014, 6:17:11 PM · Difficulty 10.7428 · 6,317,024 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a4fbad4d22b3d6b9feff3f146e87aedf7d0f621b5d0395f33d3e5bccb04b9785

Height

#495,722

Difficulty

10.742751

Transactions

7

Size

1.67 KB

Version

2

Bits

0abe24eb

Nonce

247,550,800

Timestamp

4/16/2014, 6:17:11 PM

Confirmations

6,317,024

Merkle Root

5982b546b001528b79aaa9648562f474183e746b3b3ba45f819aa6896be832a0
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.

1.053 × 10¹⁰⁰(101-digit number)
10535573722126545943…46518626565715148801
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
1.053 × 10¹⁰⁰(101-digit number)
10535573722126545943…46518626565715148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.107 × 10¹⁰⁰(101-digit number)
21071147444253091887…93037253131430297601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.214 × 10¹⁰⁰(101-digit number)
42142294888506183774…86074506262860595201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.428 × 10¹⁰⁰(101-digit number)
84284589777012367549…72149012525721190401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.685 × 10¹⁰¹(102-digit number)
16856917955402473509…44298025051442380801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.371 × 10¹⁰¹(102-digit number)
33713835910804947019…88596050102884761601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.742 × 10¹⁰¹(102-digit number)
67427671821609894039…77192100205769523201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.348 × 10¹⁰²(103-digit number)
13485534364321978807…54384200411539046401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.697 × 10¹⁰²(103-digit number)
26971068728643957615…08768400823078092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.394 × 10¹⁰²(103-digit number)
53942137457287915231…17536801646156185601
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,011 XPM·at block #6,812,745 · 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