Block #491,571

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 2:31:21 PM · Difficulty 10.6823 · 6,335,594 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dc75358c8ea5dbb41c59dc44254ae5e7450a7ea7f9b8e09e232d18dff3ed68ba

Height

#491,571

Difficulty

10.682313

Transactions

4

Size

1.30 KB

Version

2

Bits

0aaeac17

Nonce

85,475

Timestamp

4/14/2014, 2:31:21 PM

Confirmations

6,335,594

Merkle Root

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

3.398 × 10⁹⁸(99-digit number)
33982614545341726464…50214297032466585599
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
3.398 × 10⁹⁸(99-digit number)
33982614545341726464…50214297032466585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.796 × 10⁹⁸(99-digit number)
67965229090683452928…00428594064933171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.359 × 10⁹⁹(100-digit number)
13593045818136690585…00857188129866342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.718 × 10⁹⁹(100-digit number)
27186091636273381171…01714376259732684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.437 × 10⁹⁹(100-digit number)
54372183272546762342…03428752519465369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.087 × 10¹⁰⁰(101-digit number)
10874436654509352468…06857505038930739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.174 × 10¹⁰⁰(101-digit number)
21748873309018704937…13715010077861478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.349 × 10¹⁰⁰(101-digit number)
43497746618037409874…27430020155722956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.699 × 10¹⁰⁰(101-digit number)
86995493236074819748…54860040311445913599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.739 × 10¹⁰¹(102-digit number)
17399098647214963949…09720080622891827199
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,861,415 XPM·at block #6,827,164 · 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