Block #349,496

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 11:12:04 AM · Difficulty 10.2741 · 6,477,385 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee1c25e9239b773fb8c5e9c90795cfdd774d279482f3cc55e156a9b069fccabd

Height

#349,496

Difficulty

10.274104

Transactions

10

Size

2.18 KB

Version

2

Bits

0a462bae

Nonce

333,777

Timestamp

1/8/2014, 11:12:04 AM

Confirmations

6,477,385

Merkle Root

4ffdfa88e25390a369bf109cc4874d91828438af9469ca2c992cba2efa010f79
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.333 × 10⁹⁹(100-digit number)
33334480658689790869…96956747002148793601
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.333 × 10⁹⁹(100-digit number)
33334480658689790869…96956747002148793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.666 × 10⁹⁹(100-digit number)
66668961317379581739…93913494004297587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.333 × 10¹⁰⁰(101-digit number)
13333792263475916347…87826988008595174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.666 × 10¹⁰⁰(101-digit number)
26667584526951832695…75653976017190348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.333 × 10¹⁰⁰(101-digit number)
53335169053903665391…51307952034380697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.066 × 10¹⁰¹(102-digit number)
10667033810780733078…02615904068761395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.133 × 10¹⁰¹(102-digit number)
21334067621561466156…05231808137522790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.266 × 10¹⁰¹(102-digit number)
42668135243122932313…10463616275045580801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.533 × 10¹⁰¹(102-digit number)
85336270486245864627…20927232550091161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.706 × 10¹⁰²(103-digit number)
17067254097249172925…41854465100182323201
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,859,212 XPM·at block #6,826,880 · 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