Block #406,249

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2014, 3:30:06 AM · Difficulty 10.4302 · 6,410,560 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f61358635f7994a0348024779aebae66afe61fbcecdebb4d1000c7791b17adea

Height

#406,249

Difficulty

10.430240

Transactions

16

Size

4.48 KB

Version

2

Bits

0a6e2434

Nonce

3,972

Timestamp

2/16/2014, 3:30:06 AM

Confirmations

6,410,560

Merkle Root

bfff63d36fd804aaa28ed309171f135680fb2a646fa158aad9e9a201a3c4c1a3
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.296 × 10¹⁰⁰(101-digit number)
32965155250316928695…94007061043818078721
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.296 × 10¹⁰⁰(101-digit number)
32965155250316928695…94007061043818078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.593 × 10¹⁰⁰(101-digit number)
65930310500633857390…88014122087636157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.318 × 10¹⁰¹(102-digit number)
13186062100126771478…76028244175272314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.637 × 10¹⁰¹(102-digit number)
26372124200253542956…52056488350544629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.274 × 10¹⁰¹(102-digit number)
52744248400507085912…04112976701089259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.054 × 10¹⁰²(103-digit number)
10548849680101417182…08225953402178519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.109 × 10¹⁰²(103-digit number)
21097699360202834364…16451906804357038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.219 × 10¹⁰²(103-digit number)
42195398720405668729…32903813608714076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.439 × 10¹⁰²(103-digit number)
84390797440811337459…65807627217428152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.687 × 10¹⁰³(104-digit number)
16878159488162267491…31615254434856304641
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,778,509 XPM·at block #6,816,808 · 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