Block #418,027

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/24/2014, 1:30:26 PM · Difficulty 10.3961 · 6,406,741 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b43581625884c0d2ad72120f6ef00aa9b32bf74a13a96a7485fe0ebd7627d77b

Height

#418,027

Difficulty

10.396068

Transactions

4

Size

1.01 KB

Version

2

Bits

0a6564b4

Nonce

1,019,542

Timestamp

2/24/2014, 1:30:26 PM

Confirmations

6,406,741

Merkle Root

0313f837fb54da4d8c706e4ef1c7c1b9eebc4c1d88e1449e84c0fa759a27d4e6
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.475 × 10⁹⁴(95-digit number)
14755341828699374754…50823745039071958879
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.475 × 10⁹⁴(95-digit number)
14755341828699374754…50823745039071958879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.951 × 10⁹⁴(95-digit number)
29510683657398749508…01647490078143917759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.902 × 10⁹⁴(95-digit number)
59021367314797499017…03294980156287835519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.180 × 10⁹⁵(96-digit number)
11804273462959499803…06589960312575671039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.360 × 10⁹⁵(96-digit number)
23608546925918999607…13179920625151342079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.721 × 10⁹⁵(96-digit number)
47217093851837999214…26359841250302684159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.443 × 10⁹⁵(96-digit number)
94434187703675998428…52719682500605368319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.888 × 10⁹⁶(97-digit number)
18886837540735199685…05439365001210736639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.777 × 10⁹⁶(97-digit number)
37773675081470399371…10878730002421473279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.554 × 10⁹⁶(97-digit number)
75547350162940798742…21757460004842946559
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,842,215 XPM·at block #6,824,767 · 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