Block #412,655

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/20/2014, 3:48:57 PM · Difficulty 10.4225 · 6,402,485 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
95e3971e5a86bf4a83acfb0c5ac7fd5359d418c5f8b69224e09cfc005e1259ea

Height

#412,655

Difficulty

10.422496

Transactions

2

Size

1.20 KB

Version

2

Bits

0a6c28ba

Nonce

358,632

Timestamp

2/20/2014, 3:48:57 PM

Confirmations

6,402,485

Merkle Root

bb1472f2727e9a9fbb4a9fd61ba369719d0cb3efea16557f0bb23cab2018672b
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.711 × 10⁹⁴(95-digit number)
37116417765955023156…15700023271746021719
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.711 × 10⁹⁴(95-digit number)
37116417765955023156…15700023271746021719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.423 × 10⁹⁴(95-digit number)
74232835531910046312…31400046543492043439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.484 × 10⁹⁵(96-digit number)
14846567106382009262…62800093086984086879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.969 × 10⁹⁵(96-digit number)
29693134212764018524…25600186173968173759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.938 × 10⁹⁵(96-digit number)
59386268425528037049…51200372347936347519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.187 × 10⁹⁶(97-digit number)
11877253685105607409…02400744695872695039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.375 × 10⁹⁶(97-digit number)
23754507370211214819…04801489391745390079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.750 × 10⁹⁶(97-digit number)
47509014740422429639…09602978783490780159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.501 × 10⁹⁶(97-digit number)
95018029480844859279…19205957566981560319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.900 × 10⁹⁷(98-digit number)
19003605896168971855…38411915133963120639
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,765,214 XPM·at block #6,815,139 · 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