Block #472,035

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2014, 12:14:00 AM · Difficulty 10.4352 · 6,344,184 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9746969f642901ca93906707af3ca4a0dc98c0b940cc0749cf5afcfd379c0162

Height

#472,035

Difficulty

10.435214

Transactions

5

Size

1.81 KB

Version

2

Bits

0a6f6a30

Nonce

8,011

Timestamp

4/3/2014, 12:14:00 AM

Confirmations

6,344,184

Merkle Root

3160c44f550d8a18e4e45a02ce3140bd809ace26707f2ae6ed236a16d6117dbf
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.047 × 10¹⁰⁰(101-digit number)
20471993637174445401…05804741408488857599
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.047 × 10¹⁰⁰(101-digit number)
20471993637174445401…05804741408488857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.094 × 10¹⁰⁰(101-digit number)
40943987274348890802…11609482816977715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.188 × 10¹⁰⁰(101-digit number)
81887974548697781605…23218965633955430399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.637 × 10¹⁰¹(102-digit number)
16377594909739556321…46437931267910860799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.275 × 10¹⁰¹(102-digit number)
32755189819479112642…92875862535821721599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.551 × 10¹⁰¹(102-digit number)
65510379638958225284…85751725071643443199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.310 × 10¹⁰²(103-digit number)
13102075927791645056…71503450143286886399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.620 × 10¹⁰²(103-digit number)
26204151855583290113…43006900286573772799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.240 × 10¹⁰²(103-digit number)
52408303711166580227…86013800573147545599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.048 × 10¹⁰³(104-digit number)
10481660742233316045…72027601146295091199
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,773,881 XPM·at block #6,816,218 · 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