Block #504,110

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/21/2014, 1:59:55 PM · Difficulty 10.8079 · 6,303,260 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
068ebdb3d99ada2f2b405ce2469c5d8df91be73d347fff93fce9688ae723953d

Height

#504,110

Difficulty

10.807876

Transactions

3

Size

1.04 KB

Version

2

Bits

0aced0f8

Nonce

58,996,156

Timestamp

4/21/2014, 1:59:55 PM

Confirmations

6,303,260

Merkle Root

876a9d1984ea098afbbf85fd53caa7f3b2254b47c68ed8fefc827d5ec87905c9
Transactions (3)
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.671 × 10⁹⁷(98-digit number)
16719748143246360258…22784765055429935779
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.671 × 10⁹⁷(98-digit number)
16719748143246360258…22784765055429935779
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.343 × 10⁹⁷(98-digit number)
33439496286492720516…45569530110859871559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.687 × 10⁹⁷(98-digit number)
66878992572985441033…91139060221719743119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.337 × 10⁹⁸(99-digit number)
13375798514597088206…82278120443439486239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.675 × 10⁹⁸(99-digit number)
26751597029194176413…64556240886878972479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.350 × 10⁹⁸(99-digit number)
53503194058388352826…29112481773757944959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.070 × 10⁹⁹(100-digit number)
10700638811677670565…58224963547515889919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.140 × 10⁹⁹(100-digit number)
21401277623355341130…16449927095031779839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.280 × 10⁹⁹(100-digit number)
42802555246710682261…32899854190063559679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.560 × 10⁹⁹(100-digit number)
85605110493421364522…65799708380127119359
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,702,981 XPM·at block #6,807,369 · 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.

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