Block #475,918

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/5/2014, 12:35:18 PM · Difficulty 10.4653 · 6,341,163 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
42a98c9c1597f08dae7df6d092102b69845778a19ca70e44b50d4480eb9b190b

Height

#475,918

Difficulty

10.465315

Transactions

2

Size

432 B

Version

2

Bits

0a771eea

Nonce

91,147

Timestamp

4/5/2014, 12:35:18 PM

Confirmations

6,341,163

Merkle Root

3eb2e41ccb584179f1083a597d191985ca0fad4464f4189a25df34d9259ee241
Transactions (2)
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.

6.960 × 10⁹⁷(98-digit number)
69609460521645229049…36144846313413824859
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
6.960 × 10⁹⁷(98-digit number)
69609460521645229049…36144846313413824859
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.392 × 10⁹⁸(99-digit number)
13921892104329045809…72289692626827649719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.784 × 10⁹⁸(99-digit number)
27843784208658091619…44579385253655299439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.568 × 10⁹⁸(99-digit number)
55687568417316183239…89158770507310598879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.113 × 10⁹⁹(100-digit number)
11137513683463236647…78317541014621197759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.227 × 10⁹⁹(100-digit number)
22275027366926473295…56635082029242395519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.455 × 10⁹⁹(100-digit number)
44550054733852946591…13270164058484791039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.910 × 10⁹⁹(100-digit number)
89100109467705893183…26540328116969582079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.782 × 10¹⁰⁰(101-digit number)
17820021893541178636…53080656233939164159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.564 × 10¹⁰⁰(101-digit number)
35640043787082357273…06161312467878328319
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,780,685 XPM·at block #6,817,080 · 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