Block #349,428

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 10:10:12 AM · Difficulty 10.2734 · 6,460,147 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
700117723d65fa1235e11d1dfa088a5055bbf54747fbd8016d96bb1ee74a780e

Height

#349,428

Difficulty

10.273390

Transactions

39

Size

11.92 KB

Version

2

Bits

0a45fceb

Nonce

66,116

Timestamp

1/8/2014, 10:10:12 AM

Confirmations

6,460,147

Merkle Root

5f334fcbe9f3b239c4170cc37f9381eb56ca4264f1473cc30a4794e29d70dffb
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.460 × 10⁹⁷(98-digit number)
34603524655810331324…71560646478681355201
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.460 × 10⁹⁷(98-digit number)
34603524655810331324…71560646478681355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.920 × 10⁹⁷(98-digit number)
69207049311620662649…43121292957362710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.384 × 10⁹⁸(99-digit number)
13841409862324132529…86242585914725420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.768 × 10⁹⁸(99-digit number)
27682819724648265059…72485171829450841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.536 × 10⁹⁸(99-digit number)
55365639449296530119…44970343658901683201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.107 × 10⁹⁹(100-digit number)
11073127889859306023…89940687317803366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.214 × 10⁹⁹(100-digit number)
22146255779718612047…79881374635606732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.429 × 10⁹⁹(100-digit number)
44292511559437224095…59762749271213465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.858 × 10⁹⁹(100-digit number)
88585023118874448190…19525498542426931201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.771 × 10¹⁰⁰(101-digit number)
17717004623774889638…39050997084853862401
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,720,677 XPM·at block #6,809,574 · 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