Block #318,879

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 4:08:44 PM · Difficulty 10.1612 · 6,489,297 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
47cee1053f4cc45cf0cee7f16a28fcc3966b0e19166f18455fb934f7e29dfef0

Height

#318,879

Difficulty

10.161176

Transactions

12

Size

2.91 KB

Version

2

Bits

0a2942d1

Nonce

15,361

Timestamp

12/18/2013, 4:08:44 PM

Confirmations

6,489,297

Merkle Root

e00cb4086d8ce512b0f3605af26e039bb02b052900a7f5f6e74f373fab2c7b7e
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.963 × 10⁹⁹(100-digit number)
39630158085828147350…38414475858258050559
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.963 × 10⁹⁹(100-digit number)
39630158085828147350…38414475858258050559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.926 × 10⁹⁹(100-digit number)
79260316171656294700…76828951716516101119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.585 × 10¹⁰⁰(101-digit number)
15852063234331258940…53657903433032202239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.170 × 10¹⁰⁰(101-digit number)
31704126468662517880…07315806866064404479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.340 × 10¹⁰⁰(101-digit number)
63408252937325035760…14631613732128808959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.268 × 10¹⁰¹(102-digit number)
12681650587465007152…29263227464257617919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.536 × 10¹⁰¹(102-digit number)
25363301174930014304…58526454928515235839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.072 × 10¹⁰¹(102-digit number)
50726602349860028608…17052909857030471679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.014 × 10¹⁰²(103-digit number)
10145320469972005721…34105819714060943359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.029 × 10¹⁰²(103-digit number)
20290640939944011443…68211639428121886719
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,709,456 XPM·at block #6,808,175 · 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.

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