Block #412,486

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/20/2014, 1:05:21 PM · Difficulty 10.4214 · 6,402,654 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cecd5e427188994a824a1f6d5f1f58777986a082811f2222a99546ece74d488a

Height

#412,486

Difficulty

10.421422

Transactions

4

Size

1.31 KB

Version

2

Bits

0a6be256

Nonce

31,582

Timestamp

2/20/2014, 1:05:21 PM

Confirmations

6,402,654

Merkle Root

c1acf74b0fccd105705683507025103e6a69304c5ba710ccb0875cfbed66319d
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.137 × 10⁹⁹(100-digit number)
21378852818254275832…08947736800356883839
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.137 × 10⁹⁹(100-digit number)
21378852818254275832…08947736800356883839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.275 × 10⁹⁹(100-digit number)
42757705636508551664…17895473600713767679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.551 × 10⁹⁹(100-digit number)
85515411273017103329…35790947201427535359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.710 × 10¹⁰⁰(101-digit number)
17103082254603420665…71581894402855070719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.420 × 10¹⁰⁰(101-digit number)
34206164509206841331…43163788805710141439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.841 × 10¹⁰⁰(101-digit number)
68412329018413682663…86327577611420282879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.368 × 10¹⁰¹(102-digit number)
13682465803682736532…72655155222840565759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.736 × 10¹⁰¹(102-digit number)
27364931607365473065…45310310445681131519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.472 × 10¹⁰¹(102-digit number)
54729863214730946130…90620620891362263039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.094 × 10¹⁰²(103-digit number)
10945972642946189226…81241241782724526079
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,765,214 XPM·at block #6,815,139 · 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