Block #418,063

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/24/2014, 2:02:00 PM · Difficulty 10.3972 · 6,406,967 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2a9711db1e51610fd50a965dcdd9c5d45a22cf9a4d0178c4502c1958c38f0324

Height

#418,063

Difficulty

10.397200

Transactions

7

Size

2.10 KB

Version

2

Bits

0a65aeee

Nonce

57,458

Timestamp

2/24/2014, 2:02:00 PM

Confirmations

6,406,967

Merkle Root

94e26f639f125528e681877655024c15b569e6af6b123c70171697b10da79b4a
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.

9.496 × 10¹⁰²(103-digit number)
94964912636956293592…03808777196953125759
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
9.496 × 10¹⁰²(103-digit number)
94964912636956293592…03808777196953125759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.899 × 10¹⁰³(104-digit number)
18992982527391258718…07617554393906251519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.798 × 10¹⁰³(104-digit number)
37985965054782517436…15235108787812503039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.597 × 10¹⁰³(104-digit number)
75971930109565034873…30470217575625006079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.519 × 10¹⁰⁴(105-digit number)
15194386021913006974…60940435151250012159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.038 × 10¹⁰⁴(105-digit number)
30388772043826013949…21880870302500024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.077 × 10¹⁰⁴(105-digit number)
60777544087652027899…43761740605000048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.215 × 10¹⁰⁵(106-digit number)
12155508817530405579…87523481210000097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.431 × 10¹⁰⁵(106-digit number)
24311017635060811159…75046962420000194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.862 × 10¹⁰⁵(106-digit number)
48622035270121622319…50093924840000389119
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,844,323 XPM·at block #6,825,029 · 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