Block #412,958

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/20/2014, 9:27:49 PM · Difficulty 10.4189 · 6,402,033 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee0e7b40f4e8cabb28c283d3af41aa57580b49a05e26cdee9795be38e24413e2

Height

#412,958

Difficulty

10.418915

Transactions

10

Size

2.29 KB

Version

2

Bits

0a6b3e0a

Nonce

58,678

Timestamp

2/20/2014, 9:27:49 PM

Confirmations

6,402,033

Merkle Root

4500992b378b36185f9b15650403c8d5d40476459194c24f92e21463137845cf
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.029 × 10¹⁰¹(102-digit number)
30296877957043110159…33081120313075158399
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.029 × 10¹⁰¹(102-digit number)
30296877957043110159…33081120313075158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.059 × 10¹⁰¹(102-digit number)
60593755914086220318…66162240626150316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.211 × 10¹⁰²(103-digit number)
12118751182817244063…32324481252300633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.423 × 10¹⁰²(103-digit number)
24237502365634488127…64648962504601267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.847 × 10¹⁰²(103-digit number)
48475004731268976255…29297925009202534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.695 × 10¹⁰²(103-digit number)
96950009462537952510…58595850018405068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.939 × 10¹⁰³(104-digit number)
19390001892507590502…17191700036810137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.878 × 10¹⁰³(104-digit number)
38780003785015181004…34383400073620275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.756 × 10¹⁰³(104-digit number)
77560007570030362008…68766800147240550399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.551 × 10¹⁰⁴(105-digit number)
15512001514006072401…37533600294481100799
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,764,013 XPM·at block #6,814,990 · 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