Block #519,776

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 10:43:48 AM · Difficulty 10.8571 · 6,286,758 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1732763f29eb35ebdb4f860328ca5354655db9fcd534b3f2ac25e68200126b74

Height

#519,776

Difficulty

10.857146

Transactions

8

Size

2.47 KB

Version

2

Bits

0adb6dec

Nonce

25,310,797

Timestamp

5/1/2014, 10:43:48 AM

Confirmations

6,286,758

Merkle Root

9733dacea6020c9accca032b8f38da313698cfeea6c1ad0b8027ad0be8cda543
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.

4.014 × 10⁹⁹(100-digit number)
40140058463112826140…94755156466028493441
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
4.014 × 10⁹⁹(100-digit number)
40140058463112826140…94755156466028493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.028 × 10⁹⁹(100-digit number)
80280116926225652281…89510312932056986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.605 × 10¹⁰⁰(101-digit number)
16056023385245130456…79020625864113973761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.211 × 10¹⁰⁰(101-digit number)
32112046770490260912…58041251728227947521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.422 × 10¹⁰⁰(101-digit number)
64224093540980521825…16082503456455895041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.284 × 10¹⁰¹(102-digit number)
12844818708196104365…32165006912911790081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.568 × 10¹⁰¹(102-digit number)
25689637416392208730…64330013825823580161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.137 × 10¹⁰¹(102-digit number)
51379274832784417460…28660027651647160321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.027 × 10¹⁰²(103-digit number)
10275854966556883492…57320055303294320641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.055 × 10¹⁰²(103-digit number)
20551709933113766984…14640110606588641281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.110 × 10¹⁰²(103-digit number)
41103419866227533968…29280221213177282561
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,696,372 XPM·at block #6,806,533 · 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