Block #349,871

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 4:16:12 PM · Difficulty 10.2844 · 6,466,908 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9fb7a9efc9f97701f523628a8cb1d9b35e74644a030451b351d340da5f0b993b

Height

#349,871

Difficulty

10.284433

Transactions

13

Size

3.91 KB

Version

2

Bits

0a48d09f

Nonce

106,989

Timestamp

1/8/2014, 4:16:12 PM

Confirmations

6,466,908

Merkle Root

72ff242ab4b0d1f8e2b6d5951e7ed2e85e22fb46af6af9f03da63a323d4065f9
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.395 × 10⁹⁹(100-digit number)
13957509364961765273…86584150687063838721
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.395 × 10⁹⁹(100-digit number)
13957509364961765273…86584150687063838721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.791 × 10⁹⁹(100-digit number)
27915018729923530547…73168301374127677441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.583 × 10⁹⁹(100-digit number)
55830037459847061095…46336602748255354881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.116 × 10¹⁰⁰(101-digit number)
11166007491969412219…92673205496510709761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.233 × 10¹⁰⁰(101-digit number)
22332014983938824438…85346410993021419521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.466 × 10¹⁰⁰(101-digit number)
44664029967877648876…70692821986042839041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.932 × 10¹⁰⁰(101-digit number)
89328059935755297752…41385643972085678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.786 × 10¹⁰¹(102-digit number)
17865611987151059550…82771287944171356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.573 × 10¹⁰¹(102-digit number)
35731223974302119101…65542575888342712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.146 × 10¹⁰¹(102-digit number)
71462447948604238202…31085151776685424641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.429 × 10¹⁰²(103-digit number)
14292489589720847640…62170303553370849281
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,778,267 XPM·at block #6,816,778 · 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