Block #408,956

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/18/2014, 1:38:21 AM · Difficulty 10.4242 · 6,405,486 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
591817eb21f6a4d5012714fb37782f80f605e5cb3e40bf4d57dea7a983c1ba34

Height

#408,956

Difficulty

10.424205

Transactions

1

Size

968 B

Version

2

Bits

0a6c98b3

Nonce

268,705

Timestamp

2/18/2014, 1:38:21 AM

Confirmations

6,405,486

Merkle Root

40a964f20cc309996025a1c7d6df18c230f0bd1d3947c9057c4b7d3b1abbe8e2
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.

8.359 × 10⁹²(93-digit number)
83599499800706359958…14784463356456785919
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
8.359 × 10⁹²(93-digit number)
83599499800706359958…14784463356456785919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.671 × 10⁹³(94-digit number)
16719899960141271991…29568926712913571839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.343 × 10⁹³(94-digit number)
33439799920282543983…59137853425827143679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.687 × 10⁹³(94-digit number)
66879599840565087966…18275706851654287359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.337 × 10⁹⁴(95-digit number)
13375919968113017593…36551413703308574719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.675 × 10⁹⁴(95-digit number)
26751839936226035186…73102827406617149439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.350 × 10⁹⁴(95-digit number)
53503679872452070373…46205654813234298879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.070 × 10⁹⁵(96-digit number)
10700735974490414074…92411309626468597759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.140 × 10⁹⁵(96-digit number)
21401471948980828149…84822619252937195519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.280 × 10⁹⁵(96-digit number)
42802943897961656298…69645238505874391039
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,759,605 XPM·at block #6,814,441 · 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