Block #334,934

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/29/2013, 8:17:50 PM · Difficulty 10.1604 · 6,480,100 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
06e55400bb8f7df27295157c7957a4aeb2832d41bf7da079e5d7e3871b032f2e

Height

#334,934

Difficulty

10.160366

Transactions

8

Size

2.46 KB

Version

2

Bits

0a290dbe

Nonce

200,672

Timestamp

12/29/2013, 8:17:50 PM

Confirmations

6,480,100

Merkle Root

a4db75425c73b769d2a545ee2e9e94861f3fcc8a8f10b9b470fa8a161164d29b
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.109 × 10¹⁰¹(102-digit number)
31095954658909214424…41094106464609204801
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.109 × 10¹⁰¹(102-digit number)
31095954658909214424…41094106464609204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.219 × 10¹⁰¹(102-digit number)
62191909317818428849…82188212929218409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.243 × 10¹⁰²(103-digit number)
12438381863563685769…64376425858436819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.487 × 10¹⁰²(103-digit number)
24876763727127371539…28752851716873638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.975 × 10¹⁰²(103-digit number)
49753527454254743079…57505703433747276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.950 × 10¹⁰²(103-digit number)
99507054908509486159…15011406867494553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.990 × 10¹⁰³(104-digit number)
19901410981701897231…30022813734989107201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.980 × 10¹⁰³(104-digit number)
39802821963403794463…60045627469978214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.960 × 10¹⁰³(104-digit number)
79605643926807588927…20091254939956428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.592 × 10¹⁰⁴(105-digit number)
15921128785361517785…40182509879912857601
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,764,362 XPM·at block #6,815,033 · 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