Block #514,987

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2014, 12:28:51 PM · Difficulty 10.8398 · 6,300,130 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d5f8367ba75a56d33d9346888d840340fa3e172fcc19df85af6c5428d4986d75

Height

#514,987

Difficulty

10.839782

Transactions

1

Size

732 B

Version

2

Bits

0ad6fbec

Nonce

68,690

Timestamp

4/28/2014, 12:28:51 PM

Confirmations

6,300,130

Merkle Root

a49024d5cfe08aa211253d60fbaba279cc7fbbcb531ed6c400de097d1a17282e
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.663 × 10⁹⁷(98-digit number)
36639923274636470019…16410033505444316079
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.663 × 10⁹⁷(98-digit number)
36639923274636470019…16410033505444316079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.327 × 10⁹⁷(98-digit number)
73279846549272940038…32820067010888632159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.465 × 10⁹⁸(99-digit number)
14655969309854588007…65640134021777264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.931 × 10⁹⁸(99-digit number)
29311938619709176015…31280268043554528639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.862 × 10⁹⁸(99-digit number)
58623877239418352030…62560536087109057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.172 × 10⁹⁹(100-digit number)
11724775447883670406…25121072174218114559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.344 × 10⁹⁹(100-digit number)
23449550895767340812…50242144348436229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.689 × 10⁹⁹(100-digit number)
46899101791534681624…00484288696872458239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.379 × 10⁹⁹(100-digit number)
93798203583069363249…00968577393744916479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.875 × 10¹⁰⁰(101-digit number)
18759640716613872649…01937154787489832959
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,765,028 XPM·at block #6,815,116 · 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