Block #518,044

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2014, 8:32:47 AM · Difficulty 10.8524 · 6,323,859 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
827a9919ffe88560b2063af6c285f500aabae4b76b30291f9450881278cc757a

Height

#518,044

Difficulty

10.852422

Transactions

4

Size

69.72 KB

Version

2

Bits

0ada3859

Nonce

35,508

Timestamp

4/30/2014, 8:32:47 AM

Confirmations

6,323,859

Merkle Root

5b5bd409e8c8a638319eb9d8c05f2048bc5fa4b4b9a0c28f30e0f08187981060
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.936 × 10⁹⁵(96-digit number)
19363203140421314592…11464027649200855679
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.936 × 10⁹⁵(96-digit number)
19363203140421314592…11464027649200855679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.872 × 10⁹⁵(96-digit number)
38726406280842629185…22928055298401711359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.745 × 10⁹⁵(96-digit number)
77452812561685258370…45856110596803422719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.549 × 10⁹⁶(97-digit number)
15490562512337051674…91712221193606845439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.098 × 10⁹⁶(97-digit number)
30981125024674103348…83424442387213690879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.196 × 10⁹⁶(97-digit number)
61962250049348206696…66848884774427381759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.239 × 10⁹⁷(98-digit number)
12392450009869641339…33697769548854763519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.478 × 10⁹⁷(98-digit number)
24784900019739282678…67395539097709527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.956 × 10⁹⁷(98-digit number)
49569800039478565357…34791078195419054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.913 × 10⁹⁷(98-digit number)
99139600078957130714…69582156390838108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.982 × 10⁹⁸(99-digit number)
19827920015791426142…39164312781676216319
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,979,598 XPM·at block #6,841,902 · 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