Block #519,147

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 1:38:17 AM · Difficulty 10.8548 · 6,295,321 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a2d736ae454c7c3dcb75063b930e9e7d167c78fa29b6d989cffaf18a23317842

Height

#519,147

Difficulty

10.854780

Transactions

4

Size

908 B

Version

2

Bits

0adad2e5

Nonce

822,157,057

Timestamp

5/1/2014, 1:38:17 AM

Confirmations

6,295,321

Merkle Root

71a4a299a2df6ac2f867fbffa73a9d961022147d75966d0ba1445ed3614a6ead
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.

3.000 × 10⁹⁰(91-digit number)
30008138067068396267…91699849471982844761
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
3.000 × 10⁹⁰(91-digit number)
30008138067068396267…91699849471982844761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.001 × 10⁹⁰(91-digit number)
60016276134136792535…83399698943965689521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.200 × 10⁹¹(92-digit number)
12003255226827358507…66799397887931379041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.400 × 10⁹¹(92-digit number)
24006510453654717014…33598795775862758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.801 × 10⁹¹(92-digit number)
48013020907309434028…67197591551725516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.602 × 10⁹¹(92-digit number)
96026041814618868056…34395183103451032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.920 × 10⁹²(93-digit number)
19205208362923773611…68790366206902064641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.841 × 10⁹²(93-digit number)
38410416725847547222…37580732413804129281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.682 × 10⁹²(93-digit number)
76820833451695094444…75161464827608258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.536 × 10⁹³(94-digit number)
15364166690339018888…50322929655216517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.072 × 10⁹³(94-digit number)
30728333380678037777…00645859310433034241
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,759,817 XPM·at block #6,814,467 · 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