Block #408,256

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/17/2014, 12:54:20 PM · Difficulty 10.4312 · 6,408,154 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f088b63de37fcded071081644898d72f31c9a7790d259e7d7c81e651474c439c

Height

#408,256

Difficulty

10.431176

Transactions

5

Size

1.24 KB

Version

2

Bits

0a6e618a

Nonce

152,615

Timestamp

2/17/2014, 12:54:20 PM

Confirmations

6,408,154

Merkle Root

4d6993fce71df4a10aecccdf73dc9d64fa59d0dae8ef9e824442d98c155bc476
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.

5.149 × 10⁹¹(92-digit number)
51495248873593723818…35313668892427077309
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
5.149 × 10⁹¹(92-digit number)
51495248873593723818…35313668892427077309
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.029 × 10⁹²(93-digit number)
10299049774718744763…70627337784854154619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.059 × 10⁹²(93-digit number)
20598099549437489527…41254675569708309239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.119 × 10⁹²(93-digit number)
41196199098874979054…82509351139416618479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.239 × 10⁹²(93-digit number)
82392398197749958109…65018702278833236959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.647 × 10⁹³(94-digit number)
16478479639549991621…30037404557666473919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.295 × 10⁹³(94-digit number)
32956959279099983243…60074809115332947839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.591 × 10⁹³(94-digit number)
65913918558199966487…20149618230665895679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.318 × 10⁹⁴(95-digit number)
13182783711639993297…40299236461331791359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.636 × 10⁹⁴(95-digit number)
26365567423279986595…80598472922663582719
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,775,405 XPM·at block #6,816,409 · 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