Block #506,512

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 3:46:21 AM · Difficulty 10.8134 · 6,310,300 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
071e941406405df8c4924c60de9e2a91735cfff87121ed6f7fa942c085bb48b6

Height

#506,512

Difficulty

10.813372

Transactions

1

Size

799 B

Version

2

Bits

0ad0392a

Nonce

223,543

Timestamp

4/23/2014, 3:46:21 AM

Confirmations

6,310,300

Merkle Root

ab8fbe24544022c9363d585927728acee34aaf8fdb73fd305d7a7c280e364031
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.714 × 10⁹⁵(96-digit number)
37141286390718718743…11901782737922470401
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.714 × 10⁹⁵(96-digit number)
37141286390718718743…11901782737922470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.428 × 10⁹⁵(96-digit number)
74282572781437437487…23803565475844940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.485 × 10⁹⁶(97-digit number)
14856514556287487497…47607130951689881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.971 × 10⁹⁶(97-digit number)
29713029112574974995…95214261903379763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.942 × 10⁹⁶(97-digit number)
59426058225149949990…90428523806759526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.188 × 10⁹⁷(98-digit number)
11885211645029989998…80857047613519052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.377 × 10⁹⁷(98-digit number)
23770423290059979996…61714095227038105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.754 × 10⁹⁷(98-digit number)
47540846580119959992…23428190454076211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.508 × 10⁹⁷(98-digit number)
95081693160239919984…46856380908152422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.901 × 10⁹⁸(99-digit number)
19016338632047983996…93712761816304844801
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,778,533 XPM·at block #6,816,811 · 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