Block #407,414

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 10:35:35 PM · Difficulty 10.4328 · 6,408,808 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2402b2d88dcf38e805ae10b408b7bec379cde8903a6ac93ef6db4b7d54c1ac50

Height

#407,414

Difficulty

10.432828

Transactions

2

Size

1.02 KB

Version

2

Bits

0a6ecdd4

Nonce

11,382,264

Timestamp

2/16/2014, 10:35:35 PM

Confirmations

6,408,808

Merkle Root

c2451ffa3b35af63e3c6dc7ee3c0c0a614e957a036c0c72037ef8f8c4f62c78c
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.514 × 10⁹⁵(96-digit number)
15142399112133913487…11640855998477817599
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.514 × 10⁹⁵(96-digit number)
15142399112133913487…11640855998477817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.028 × 10⁹⁵(96-digit number)
30284798224267826975…23281711996955635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.056 × 10⁹⁵(96-digit number)
60569596448535653951…46563423993911270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.211 × 10⁹⁶(97-digit number)
12113919289707130790…93126847987822540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.422 × 10⁹⁶(97-digit number)
24227838579414261580…86253695975645081599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.845 × 10⁹⁶(97-digit number)
48455677158828523161…72507391951290163199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.691 × 10⁹⁶(97-digit number)
96911354317657046323…45014783902580326399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.938 × 10⁹⁷(98-digit number)
19382270863531409264…90029567805160652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.876 × 10⁹⁷(98-digit number)
38764541727062818529…80059135610321305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.752 × 10⁹⁷(98-digit number)
77529083454125637058…60118271220642611199
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,904 XPM·at block #6,816,221 · 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