Block #502,056

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2014, 4:14:27 AM · Difficulty 10.8066 · 6,314,255 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7665b253da3cfea6aee8a9d96bbccd337313e893128a38df256bc406f91a9a60

Height

#502,056

Difficulty

10.806584

Transactions

9

Size

2.40 KB

Version

2

Bits

0ace7c4a

Nonce

122,362,875

Timestamp

4/20/2014, 4:14:27 AM

Confirmations

6,314,255

Merkle Root

3cb41781ae207bcc82a5028e3d1b700b6fe98fc2b38e22601fc6dae379398d1b
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.

1.249 × 10¹⁰⁰(101-digit number)
12495386657777689550…95959943027174092799
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
1.249 × 10¹⁰⁰(101-digit number)
12495386657777689550…95959943027174092799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.499 × 10¹⁰⁰(101-digit number)
24990773315555379100…91919886054348185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.998 × 10¹⁰⁰(101-digit number)
49981546631110758201…83839772108696371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.996 × 10¹⁰⁰(101-digit number)
99963093262221516402…67679544217392742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.999 × 10¹⁰¹(102-digit number)
19992618652444303280…35359088434785484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.998 × 10¹⁰¹(102-digit number)
39985237304888606561…70718176869570969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.997 × 10¹⁰¹(102-digit number)
79970474609777213122…41436353739141939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.599 × 10¹⁰²(103-digit number)
15994094921955442624…82872707478283878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.198 × 10¹⁰²(103-digit number)
31988189843910885248…65745414956567756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.397 × 10¹⁰²(103-digit number)
63976379687821770497…31490829913135513599
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,774,609 XPM·at block #6,816,310 · 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