Block #340,961

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 3:44:49 AM · Difficulty 10.1321 · 6,465,669 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50491a65c0713abb4f4e574f090247287db17f7843fbea5511952834b4419aed

Height

#340,961

Difficulty

10.132084

Transactions

2

Size

728 B

Version

2

Bits

0a21d042

Nonce

229,343

Timestamp

1/3/2014, 3:44:49 AM

Confirmations

6,465,669

Merkle Root

83134f3c73e041c5f40b289766412f503a02622ff1b884e9b986b773b81819a4
Transactions (2)
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.605 × 10¹⁰⁸(109-digit number)
16059241303463474193…78294978934154304001
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.605 × 10¹⁰⁸(109-digit number)
16059241303463474193…78294978934154304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.211 × 10¹⁰⁸(109-digit number)
32118482606926948386…56589957868308608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.423 × 10¹⁰⁸(109-digit number)
64236965213853896772…13179915736617216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.284 × 10¹⁰⁹(110-digit number)
12847393042770779354…26359831473234432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.569 × 10¹⁰⁹(110-digit number)
25694786085541558708…52719662946468864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.138 × 10¹⁰⁹(110-digit number)
51389572171083117417…05439325892937728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.027 × 10¹¹⁰(111-digit number)
10277914434216623483…10878651785875456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.055 × 10¹¹⁰(111-digit number)
20555828868433246967…21757303571750912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.111 × 10¹¹⁰(111-digit number)
41111657736866493934…43514607143501824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.222 × 10¹¹⁰(111-digit number)
82223315473732987868…87029214287003648001
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,140 XPM·at block #6,806,629 · 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