Block #358,991

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 12:05:59 PM · Difficulty 10.3839 · 6,457,178 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
436923c64cc559eda7c75e38489f8aa0ce32fc10ffc1aac825b0cc41a86cc24b

Height

#358,991

Difficulty

10.383903

Transactions

5

Size

26.90 KB

Version

2

Bits

0a624777

Nonce

551

Timestamp

1/14/2014, 12:05:59 PM

Confirmations

6,457,178

Merkle Root

abb187efc81960cc937c4fffc931546cfa10d224499ef7dff90d00540ea8222c
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.120 × 10⁹⁸(99-digit number)
11200835019382243529…94101194900158196799
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.120 × 10⁹⁸(99-digit number)
11200835019382243529…94101194900158196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.240 × 10⁹⁸(99-digit number)
22401670038764487058…88202389800316393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.480 × 10⁹⁸(99-digit number)
44803340077528974116…76404779600632787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.960 × 10⁹⁸(99-digit number)
89606680155057948232…52809559201265574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.792 × 10⁹⁹(100-digit number)
17921336031011589646…05619118402531148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.584 × 10⁹⁹(100-digit number)
35842672062023179292…11238236805062297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.168 × 10⁹⁹(100-digit number)
71685344124046358585…22476473610124595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.433 × 10¹⁰⁰(101-digit number)
14337068824809271717…44952947220249190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.867 × 10¹⁰⁰(101-digit number)
28674137649618543434…89905894440498380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.734 × 10¹⁰⁰(101-digit number)
57348275299237086868…79811788880996761599
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,475 XPM·at block #6,816,168 · 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