Block #410,596

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/19/2014, 4:34:03 AM · Difficulty 10.4283 · 6,396,882 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
576e9b58f5f5fc06fa6ed279572da312a3776907ddd9cf3889f816a6987228e5

Height

#410,596

Difficulty

10.428341

Transactions

9

Size

2.11 KB

Version

2

Bits

0a6da7ba

Nonce

39,526

Timestamp

2/19/2014, 4:34:03 AM

Confirmations

6,396,882

Merkle Root

bdf2da416061ce093e17090f68a8bd290493e40227b7ae2780e6a4b3910d1c5a
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.070 × 10⁹⁹(100-digit number)
10707583761243978239…68901563283348377501
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.070 × 10⁹⁹(100-digit number)
10707583761243978239…68901563283348377501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.141 × 10⁹⁹(100-digit number)
21415167522487956479…37803126566696755001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.283 × 10⁹⁹(100-digit number)
42830335044975912958…75606253133393510001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.566 × 10⁹⁹(100-digit number)
85660670089951825916…51212506266787020001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.713 × 10¹⁰⁰(101-digit number)
17132134017990365183…02425012533574040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.426 × 10¹⁰⁰(101-digit number)
34264268035980730366…04850025067148080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.852 × 10¹⁰⁰(101-digit number)
68528536071961460732…09700050134296160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.370 × 10¹⁰¹(102-digit number)
13705707214392292146…19400100268592320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.741 × 10¹⁰¹(102-digit number)
27411414428784584293…38800200537184640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.482 × 10¹⁰¹(102-digit number)
54822828857569168586…77600401074369280001
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,703,850 XPM·at block #6,807,477 · 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