Block #514,083

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2014, 10:26:11 PM · Difficulty 10.8376 · 6,292,452 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f28d1f9aa41b2cf64f91d4a647ba8387ba15d31003047075e72cf87c8df7394

Height

#514,083

Difficulty

10.837570

Transactions

8

Size

2.89 KB

Version

2

Bits

0ad66b01

Nonce

54,284,114

Timestamp

4/27/2014, 10:26:11 PM

Confirmations

6,292,452

Merkle Root

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

6.219 × 10⁹⁸(99-digit number)
62194919249700717632…71189164240916124961
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
6.219 × 10⁹⁸(99-digit number)
62194919249700717632…71189164240916124961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.243 × 10⁹⁹(100-digit number)
12438983849940143526…42378328481832249921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.487 × 10⁹⁹(100-digit number)
24877967699880287053…84756656963664499841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.975 × 10⁹⁹(100-digit number)
49755935399760574106…69513313927328999681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.951 × 10⁹⁹(100-digit number)
99511870799521148212…39026627854657999361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.990 × 10¹⁰⁰(101-digit number)
19902374159904229642…78053255709315998721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.980 × 10¹⁰⁰(101-digit number)
39804748319808459284…56106511418631997441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.960 × 10¹⁰⁰(101-digit number)
79609496639616918569…12213022837263994881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.592 × 10¹⁰¹(102-digit number)
15921899327923383713…24426045674527989761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.184 × 10¹⁰¹(102-digit number)
31843798655846767427…48852091349055979521
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,696,380 XPM·at block #6,806,534 · 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