Block #415,577

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/22/2014, 7:32:51 PM · Difficulty 10.4030 · 6,400,642 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b483dc3822687292c358d2e7cc2648534b10f1d0ce68c4cb61ee93e2069d7831

Height

#415,577

Difficulty

10.402987

Transactions

2

Size

16.88 KB

Version

2

Bits

0a672a26

Nonce

70,472

Timestamp

2/22/2014, 7:32:51 PM

Confirmations

6,400,642

Merkle Root

bd8607a9f6a6a037e6973c08593e73fd17c68735539e3d449c555d013cead6b2
Transactions (2)
1 in → 1 out9.4100 XPM110 B
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.

1.490 × 10⁹⁵(96-digit number)
14909724741183792140…77795137499619875199
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
1.490 × 10⁹⁵(96-digit number)
14909724741183792140…77795137499619875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.981 × 10⁹⁵(96-digit number)
29819449482367584281…55590274999239750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.963 × 10⁹⁵(96-digit number)
59638898964735168563…11180549998479500799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.192 × 10⁹⁶(97-digit number)
11927779792947033712…22361099996959001599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.385 × 10⁹⁶(97-digit number)
23855559585894067425…44722199993918003199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.771 × 10⁹⁶(97-digit number)
47711119171788134850…89444399987836006399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.542 × 10⁹⁶(97-digit number)
95422238343576269701…78888799975672012799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.908 × 10⁹⁷(98-digit number)
19084447668715253940…57777599951344025599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.816 × 10⁹⁷(98-digit number)
38168895337430507880…15555199902688051199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.633 × 10⁹⁷(98-digit number)
76337790674861015760…31110399805376102399
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,773,881 XPM·at block #6,816,218 · 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