Block #515,638

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2014, 10:06:09 PM · Difficulty 10.8420 · 6,309,920 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27484ea3d005a89e76f39f1ed435fe6fd19077d7f2af1a9a5148cde5752adde2

Height

#515,638

Difficulty

10.842040

Transactions

11

Size

3.75 KB

Version

2

Bits

0ad78fef

Nonce

98,916,821

Timestamp

4/28/2014, 10:06:09 PM

Confirmations

6,309,920

Merkle Root

437fc632cc69a3ed3d9e4b1f1ad36f5e405902515822f09ee6fd81bab9066558
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.605 × 10⁹⁸(99-digit number)
16056011343214261963…21278773512887894959
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.605 × 10⁹⁸(99-digit number)
16056011343214261963…21278773512887894959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.211 × 10⁹⁸(99-digit number)
32112022686428523927…42557547025775789919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.422 × 10⁹⁸(99-digit number)
64224045372857047854…85115094051551579839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.284 × 10⁹⁹(100-digit number)
12844809074571409570…70230188103103159679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.568 × 10⁹⁹(100-digit number)
25689618149142819141…40460376206206319359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.137 × 10⁹⁹(100-digit number)
51379236298285638283…80920752412412638719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.027 × 10¹⁰⁰(101-digit number)
10275847259657127656…61841504824825277439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.055 × 10¹⁰⁰(101-digit number)
20551694519314255313…23683009649650554879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.110 × 10¹⁰⁰(101-digit number)
41103389038628510626…47366019299301109759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.220 × 10¹⁰⁰(101-digit number)
82206778077257021253…94732038598602219519
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,848,564 XPM·at block #6,825,557 · 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