Block #510,972

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/25/2014, 11:09:41 PM · Difficulty 10.8284 · 6,304,171 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c11a03bd46cbcf1d998c28abee5398200de11a9c5a5facc7d886793f671aa753

Height

#510,972

Difficulty

10.828372

Transactions

8

Size

4.13 KB

Version

2

Bits

0ad41029

Nonce

193,159,247

Timestamp

4/25/2014, 11:09:41 PM

Confirmations

6,304,171

Merkle Root

7784a32770f4c6a070c4a15c7592632cefe5bc1bf8a573429f106291b36efdd4
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.870 × 10⁹⁹(100-digit number)
18704344091201513431…88728352492795781119
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.870 × 10⁹⁹(100-digit number)
18704344091201513431…88728352492795781119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.740 × 10⁹⁹(100-digit number)
37408688182403026862…77456704985591562239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.481 × 10⁹⁹(100-digit number)
74817376364806053725…54913409971183124479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.496 × 10¹⁰⁰(101-digit number)
14963475272961210745…09826819942366248959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.992 × 10¹⁰⁰(101-digit number)
29926950545922421490…19653639884732497919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.985 × 10¹⁰⁰(101-digit number)
59853901091844842980…39307279769464995839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.197 × 10¹⁰¹(102-digit number)
11970780218368968596…78614559538929991679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.394 × 10¹⁰¹(102-digit number)
23941560436737937192…57229119077859983359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.788 × 10¹⁰¹(102-digit number)
47883120873475874384…14458238155719966719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.576 × 10¹⁰¹(102-digit number)
95766241746951748768…28916476311439933439
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,238 XPM·at block #6,815,142 · 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