Block #359,246

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 3:50:03 PM · Difficulty 10.3877 · 6,458,132 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e9bdd1db5f5b05dee814a200682e9b9b1efb786124285248a4e2c7f22f9d900b

Height

#359,246

Difficulty

10.387723

Transactions

5

Size

1.09 KB

Version

2

Bits

0a6341cf

Nonce

175,762

Timestamp

1/14/2014, 3:50:03 PM

Confirmations

6,458,132

Merkle Root

094eb8a27c615351be0a67ee8ab3f9c5254c920a0840346de8c73a21eedf85f2
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.268 × 10¹⁰⁴(105-digit number)
32682239272655137252…95314286697851972519
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.268 × 10¹⁰⁴(105-digit number)
32682239272655137252…95314286697851972519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.536 × 10¹⁰⁴(105-digit number)
65364478545310274504…90628573395703945039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.307 × 10¹⁰⁵(106-digit number)
13072895709062054900…81257146791407890079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.614 × 10¹⁰⁵(106-digit number)
26145791418124109801…62514293582815780159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.229 × 10¹⁰⁵(106-digit number)
52291582836248219603…25028587165631560319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.045 × 10¹⁰⁶(107-digit number)
10458316567249643920…50057174331263120639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.091 × 10¹⁰⁶(107-digit number)
20916633134499287841…00114348662526241279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.183 × 10¹⁰⁶(107-digit number)
41833266268998575683…00228697325052482559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.366 × 10¹⁰⁶(107-digit number)
83666532537997151366…00457394650104965119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.673 × 10¹⁰⁷(108-digit number)
16733306507599430273…00914789300209930239
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,783,065 XPM·at block #6,817,377 · 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