Block #349,911

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 4:47:43 PM · Difficulty 10.2855 · 6,458,264 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
52861f1337584adf3e8e2d565aa05d4a5d521f0a301af1a61b1808038edce872

Height

#349,911

Difficulty

10.285487

Transactions

4

Size

18.89 KB

Version

2

Bits

0a4915b1

Nonce

249,606

Timestamp

1/8/2014, 4:47:43 PM

Confirmations

6,458,264

Merkle Root

cab61d999805138615807ad95842ac48a773565724db927b8c22718ff65d3989
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.026 × 10⁹⁷(98-digit number)
20265601281047524112…86896447339406678081
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.026 × 10⁹⁷(98-digit number)
20265601281047524112…86896447339406678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.053 × 10⁹⁷(98-digit number)
40531202562095048224…73792894678813356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.106 × 10⁹⁷(98-digit number)
81062405124190096448…47585789357626712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.621 × 10⁹⁸(99-digit number)
16212481024838019289…95171578715253424641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.242 × 10⁹⁸(99-digit number)
32424962049676038579…90343157430506849281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.484 × 10⁹⁸(99-digit number)
64849924099352077158…80686314861013698561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.296 × 10⁹⁹(100-digit number)
12969984819870415431…61372629722027397121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.593 × 10⁹⁹(100-digit number)
25939969639740830863…22745259444054794241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.187 × 10⁹⁹(100-digit number)
51879939279481661727…45490518888109588481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.037 × 10¹⁰⁰(101-digit number)
10375987855896332345…90981037776219176961
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,709,448 XPM·at block #6,808,174 · 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.

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