Block #499,372

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/18/2014, 2:09:46 PM · Difficulty 10.7900 · 6,310,248 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8460fc18026137f32cd274623597b69b82058baa014fd47068d8a2de6d385bef

Height

#499,372

Difficulty

10.789978

Transactions

1

Size

800 B

Version

2

Bits

0aca3c00

Nonce

6,307

Timestamp

4/18/2014, 2:09:46 PM

Confirmations

6,310,248

Merkle Root

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

2.156 × 10⁹⁶(97-digit number)
21565685628047231166…98196665111896789761
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
2.156 × 10⁹⁶(97-digit number)
21565685628047231166…98196665111896789761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.313 × 10⁹⁶(97-digit number)
43131371256094462332…96393330223793579521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.626 × 10⁹⁶(97-digit number)
86262742512188924664…92786660447587159041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.725 × 10⁹⁷(98-digit number)
17252548502437784932…85573320895174318081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.450 × 10⁹⁷(98-digit number)
34505097004875569865…71146641790348636161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.901 × 10⁹⁷(98-digit number)
69010194009751139731…42293283580697272321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.380 × 10⁹⁸(99-digit number)
13802038801950227946…84586567161394544641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.760 × 10⁹⁸(99-digit number)
27604077603900455892…69173134322789089281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.520 × 10⁹⁸(99-digit number)
55208155207800911785…38346268645578178561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.104 × 10⁹⁹(100-digit number)
11041631041560182357…76692537291156357121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.208 × 10⁹⁹(100-digit number)
22083262083120364714…53385074582312714241
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,721,037 XPM·at block #6,809,619 · 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