Block #354,941

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 8:29:13 PM · Difficulty 10.3525 · 6,458,995 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d7049941f3492e7646057317b6a570d99fa29953e6213dddc9ed160fc725abe2

Height

#354,941

Difficulty

10.352513

Transactions

4

Size

1.71 KB

Version

2

Bits

0a5a3e46

Nonce

139,036

Timestamp

1/11/2014, 8:29:13 PM

Confirmations

6,458,995

Merkle Root

59ebda56e0732d329ed9fc2604756966ef4f0a45c30544b3c483432490956014
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.

2.867 × 10⁹²(93-digit number)
28678528718552473044…29164234645318912001
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
2.867 × 10⁹²(93-digit number)
28678528718552473044…29164234645318912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.735 × 10⁹²(93-digit number)
57357057437104946088…58328469290637824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.147 × 10⁹³(94-digit number)
11471411487420989217…16656938581275648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.294 × 10⁹³(94-digit number)
22942822974841978435…33313877162551296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.588 × 10⁹³(94-digit number)
45885645949683956870…66627754325102592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.177 × 10⁹³(94-digit number)
91771291899367913741…33255508650205184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.835 × 10⁹⁴(95-digit number)
18354258379873582748…66511017300410368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.670 × 10⁹⁴(95-digit number)
36708516759747165496…33022034600820736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.341 × 10⁹⁴(95-digit number)
73417033519494330993…66044069201641472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.468 × 10⁹⁵(96-digit number)
14683406703898866198…32088138403282944001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,755,564 XPM·at block #6,813,935 · 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