Block #519,427

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 5:37:52 AM · Difficulty 10.8559 · 6,290,096 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f76a0249eaa9d821d234395df50274de7234b7ac9eca7c4cfd269cf63af11db7

Height

#519,427

Difficulty

10.855864

Transactions

5

Size

1.09 KB

Version

2

Bits

0adb19ee

Nonce

57,682,314

Timestamp

5/1/2014, 5:37:52 AM

Confirmations

6,290,096

Merkle Root

96b8f61c7b7a65729e31fcc28dff07a6c1b99de00a26a78090c2a896ecdb23f6
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.643 × 10⁹⁹(100-digit number)
16434477882745628169…04324054425806945601
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.643 × 10⁹⁹(100-digit number)
16434477882745628169…04324054425806945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.286 × 10⁹⁹(100-digit number)
32868955765491256339…08648108851613891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.573 × 10⁹⁹(100-digit number)
65737911530982512679…17296217703227782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.314 × 10¹⁰⁰(101-digit number)
13147582306196502535…34592435406455564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.629 × 10¹⁰⁰(101-digit number)
26295164612393005071…69184870812911129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.259 × 10¹⁰⁰(101-digit number)
52590329224786010143…38369741625822259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.051 × 10¹⁰¹(102-digit number)
10518065844957202028…76739483251644518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.103 × 10¹⁰¹(102-digit number)
21036131689914404057…53478966503289036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.207 × 10¹⁰¹(102-digit number)
42072263379828808115…06957933006578073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.414 × 10¹⁰¹(102-digit number)
84144526759657616230…13915866013156147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.682 × 10¹⁰²(103-digit number)
16828905351931523246…27831732026312294401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,720,261 XPM·at block #6,809,522 · 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