Block #350,260

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 10:35:31 PM · Difficulty 10.2861 · 6,456,382 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e866c0869271883a57105761797b58841f80037e3e2c441a35443228ed0f94de

Height

#350,260

Difficulty

10.286119

Transactions

10

Size

2.41 KB

Version

2

Bits

0a493f10

Nonce

344,998

Timestamp

1/8/2014, 10:35:31 PM

Confirmations

6,456,382

Merkle Root

d502399db7428e0a721fb5a7cb50d0e2fbef438ed25c0fe44f4b0a06331d6408
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.475 × 10⁹⁸(99-digit number)
14753709790130749896…70063685079445628801
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.475 × 10⁹⁸(99-digit number)
14753709790130749896…70063685079445628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.950 × 10⁹⁸(99-digit number)
29507419580261499792…40127370158891257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.901 × 10⁹⁸(99-digit number)
59014839160522999584…80254740317782515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.180 × 10⁹⁹(100-digit number)
11802967832104599916…60509480635565030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.360 × 10⁹⁹(100-digit number)
23605935664209199833…21018961271130060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.721 × 10⁹⁹(100-digit number)
47211871328418399667…42037922542260121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.442 × 10⁹⁹(100-digit number)
94423742656836799335…84075845084520243201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.888 × 10¹⁰⁰(101-digit number)
18884748531367359867…68151690169040486401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.776 × 10¹⁰⁰(101-digit number)
37769497062734719734…36303380338080972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.553 × 10¹⁰⁰(101-digit number)
75538994125469439468…72606760676161945601
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,697,230 XPM·at block #6,806,641 · 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