Block #501,317

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2014, 5:24:57 PM · Difficulty 10.8029 · 6,312,898 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b3cb339e3074fd74700c6457be381989a4759729e3b12402c804abbc43baca0f

Height

#501,317

Difficulty

10.802937

Transactions

6

Size

1.59 KB

Version

2

Bits

0acd8d40

Nonce

699,849,983

Timestamp

4/19/2014, 5:24:57 PM

Confirmations

6,312,898

Merkle Root

ded68a708ce22f433e36348d7b14f338a526e9786c03aa27b503d896c972254d
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.949 × 10⁹⁴(95-digit number)
29498631482938731159…97925402249537519049
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.949 × 10⁹⁴(95-digit number)
29498631482938731159…97925402249537519049
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.899 × 10⁹⁴(95-digit number)
58997262965877462318…95850804499075038099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.179 × 10⁹⁵(96-digit number)
11799452593175492463…91701608998150076199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.359 × 10⁹⁵(96-digit number)
23598905186350984927…83403217996300152399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.719 × 10⁹⁵(96-digit number)
47197810372701969854…66806435992600304799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.439 × 10⁹⁵(96-digit number)
94395620745403939709…33612871985200609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.887 × 10⁹⁶(97-digit number)
18879124149080787941…67225743970401219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.775 × 10⁹⁶(97-digit number)
37758248298161575883…34451487940802438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.551 × 10⁹⁶(97-digit number)
75516496596323151767…68902975881604876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.510 × 10⁹⁷(98-digit number)
15103299319264630353…37805951763209753599
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,757,789 XPM·at block #6,814,214 · 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