Block #318,508

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 10:01:44 AM · Difficulty 10.1605 · 6,490,827 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7d8061675435d38f42f320f3dda57a1087838e0be16dfa1bf8d506973fa4d750

Height

#318,508

Difficulty

10.160473

Transactions

8

Size

3.62 KB

Version

2

Bits

0a2914ba

Nonce

293,755

Timestamp

12/18/2013, 10:01:44 AM

Confirmations

6,490,827

Merkle Root

8355926069c668f9dec918f189d1cc8706ebe7cda125bf452dc22f4abdc4a0a7
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.911 × 10⁹⁸(99-digit number)
39116608638701400532…50826834115842515159
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.911 × 10⁹⁸(99-digit number)
39116608638701400532…50826834115842515159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.823 × 10⁹⁸(99-digit number)
78233217277402801064…01653668231685030319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.564 × 10⁹⁹(100-digit number)
15646643455480560212…03307336463370060639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.129 × 10⁹⁹(100-digit number)
31293286910961120425…06614672926740121279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.258 × 10⁹⁹(100-digit number)
62586573821922240851…13229345853480242559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.251 × 10¹⁰⁰(101-digit number)
12517314764384448170…26458691706960485119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.503 × 10¹⁰⁰(101-digit number)
25034629528768896340…52917383413920970239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.006 × 10¹⁰⁰(101-digit number)
50069259057537792681…05834766827841940479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.001 × 10¹⁰¹(102-digit number)
10013851811507558536…11669533655683880959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.002 × 10¹⁰¹(102-digit number)
20027703623015117072…23339067311367761919
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,718,747 XPM·at block #6,809,334 · 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