Block #355,024

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 9:30:49 PM · Difficulty 10.3553 · 6,461,180 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
904707c348c79790feb9a3a49e7a3420060cf33da93b60be5b54c50fed30b8f8

Height

#355,024

Difficulty

10.355287

Transactions

7

Size

1.67 KB

Version

2

Bits

0a5af411

Nonce

25,858

Timestamp

1/11/2014, 9:30:49 PM

Confirmations

6,461,180

Merkle Root

485e5bd2fc0ddee9fc2d5cef532e11892f3596ac132b1c29e9bdad61006b4d71
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.

6.793 × 10⁹⁵(96-digit number)
67933264938287845056…92620239456323112961
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
6.793 × 10⁹⁵(96-digit number)
67933264938287845056…92620239456323112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.358 × 10⁹⁶(97-digit number)
13586652987657569011…85240478912646225921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.717 × 10⁹⁶(97-digit number)
27173305975315138022…70480957825292451841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.434 × 10⁹⁶(97-digit number)
54346611950630276045…40961915650584903681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.086 × 10⁹⁷(98-digit number)
10869322390126055209…81923831301169807361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.173 × 10⁹⁷(98-digit number)
21738644780252110418…63847662602339614721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.347 × 10⁹⁷(98-digit number)
43477289560504220836…27695325204679229441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.695 × 10⁹⁷(98-digit number)
86954579121008441672…55390650409358458881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.739 × 10⁹⁸(99-digit number)
17390915824201688334…10781300818716917761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.478 × 10⁹⁸(99-digit number)
34781831648403376668…21562601637433835521
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,773,758 XPM·at block #6,816,203 · 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