Block #506,978

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2014, 10:28:34 AM · Difficulty 10.8158 · 6,303,295 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
90d862569acf4ac4fd356c8ed40027ee4c574747cf5aa0101912f0870aa4105a

Height

#506,978

Difficulty

10.815768

Transactions

8

Size

6.33 KB

Version

2

Bits

0ad0d631

Nonce

42,285

Timestamp

4/23/2014, 10:28:34 AM

Confirmations

6,303,295

Merkle Root

a1d5b71ba021862724966ac16319e789b5db0da06e717e4c6e794b9c7b4d983e
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.

2.131 × 10⁹⁹(100-digit number)
21317895357504391391…68860251832471058239
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
2.131 × 10⁹⁹(100-digit number)
21317895357504391391…68860251832471058239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.263 × 10⁹⁹(100-digit number)
42635790715008782782…37720503664942116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.527 × 10⁹⁹(100-digit number)
85271581430017565564…75441007329884232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.705 × 10¹⁰⁰(101-digit number)
17054316286003513112…50882014659768465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.410 × 10¹⁰⁰(101-digit number)
34108632572007026225…01764029319536931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.821 × 10¹⁰⁰(101-digit number)
68217265144014052451…03528058639073863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.364 × 10¹⁰¹(102-digit number)
13643453028802810490…07056117278147727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.728 × 10¹⁰¹(102-digit number)
27286906057605620980…14112234556295454719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.457 × 10¹⁰¹(102-digit number)
54573812115211241961…28224469112590909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.091 × 10¹⁰²(103-digit number)
10914762423042248392…56448938225181818879
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,726,257 XPM·at block #6,810,272 · 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