Block #517,384

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2014, 10:17:13 PM · Difficulty 10.8510 · 6,323,791 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
094f5dacd45e268550074be37118fe16d1efb90c7d843266437990cd4b592052

Height

#517,384

Difficulty

10.851048

Transactions

7

Size

2.27 KB

Version

2

Bits

0ad9de40

Nonce

55,939,604

Timestamp

4/29/2014, 10:17:13 PM

Confirmations

6,323,791

Merkle Root

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

7.609 × 10¹⁰⁰(101-digit number)
76095247274460095194…67004765790008360959
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
7.609 × 10¹⁰⁰(101-digit number)
76095247274460095194…67004765790008360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.521 × 10¹⁰¹(102-digit number)
15219049454892019038…34009531580016721919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.043 × 10¹⁰¹(102-digit number)
30438098909784038077…68019063160033443839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.087 × 10¹⁰¹(102-digit number)
60876197819568076155…36038126320066887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.217 × 10¹⁰²(103-digit number)
12175239563913615231…72076252640133775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.435 × 10¹⁰²(103-digit number)
24350479127827230462…44152505280267550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.870 × 10¹⁰²(103-digit number)
48700958255654460924…88305010560535101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.740 × 10¹⁰²(103-digit number)
97401916511308921848…76610021121070202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.948 × 10¹⁰³(104-digit number)
19480383302261784369…53220042242140405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.896 × 10¹⁰³(104-digit number)
38960766604523568739…06440084484280811519
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,973,758 XPM·at block #6,841,174 · 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