Block #519,120

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 1:17:16 AM · Difficulty 10.8546 · 6,290,526 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
046968ba2baaf869b2f7cf0cbd03da5ef5eba515a3835c72674eae3ef1dd7638

Height

#519,120

Difficulty

10.854625

Transactions

3

Size

869 B

Version

2

Bits

0adac8ac

Nonce

40,736

Timestamp

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

Confirmations

6,290,526

Merkle Root

ccab0acfd1a1ca11aacf6363e3af98fdbf253baedae7b9cc0a997a9a0e70b55f
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.

7.942 × 10⁹⁷(98-digit number)
79420821121706723428…59510525919444040441
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
7.942 × 10⁹⁷(98-digit number)
79420821121706723428…59510525919444040441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.588 × 10⁹⁸(99-digit number)
15884164224341344685…19021051838888080881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.176 × 10⁹⁸(99-digit number)
31768328448682689371…38042103677776161761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.353 × 10⁹⁸(99-digit number)
63536656897365378742…76084207355552323521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.270 × 10⁹⁹(100-digit number)
12707331379473075748…52168414711104647041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.541 × 10⁹⁹(100-digit number)
25414662758946151497…04336829422209294081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.082 × 10⁹⁹(100-digit number)
50829325517892302994…08673658844418588161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.016 × 10¹⁰⁰(101-digit number)
10165865103578460598…17347317688837176321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.033 × 10¹⁰⁰(101-digit number)
20331730207156921197…34694635377674352641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.066 × 10¹⁰⁰(101-digit number)
40663460414313842395…69389270755348705281
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,721,248 XPM·at block #6,809,645 · 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