Block #403,504

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 5:44:23 AM · Difficulty 10.4291 · 6,407,630 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a47ece3ecea5390aae9016e2b54528487d2f052708c84c445b89ecbc67b0e0a7

Height

#403,504

Difficulty

10.429062

Transactions

3

Size

653 B

Version

2

Bits

0a6dd6fb

Nonce

162,449

Timestamp

2/14/2014, 5:44:23 AM

Confirmations

6,407,630

Merkle Root

9858b5bbab31615a30a682272a3c61056960240693fc47a1f414963e15a4f1b3
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.

5.291 × 10¹⁰¹(102-digit number)
52914030907045569682…03737235867515829761
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
5.291 × 10¹⁰¹(102-digit number)
52914030907045569682…03737235867515829761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.058 × 10¹⁰²(103-digit number)
10582806181409113936…07474471735031659521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.116 × 10¹⁰²(103-digit number)
21165612362818227873…14948943470063319041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.233 × 10¹⁰²(103-digit number)
42331224725636455746…29897886940126638081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.466 × 10¹⁰²(103-digit number)
84662449451272911492…59795773880253276161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.693 × 10¹⁰³(104-digit number)
16932489890254582298…19591547760506552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.386 × 10¹⁰³(104-digit number)
33864979780509164596…39183095521013104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.772 × 10¹⁰³(104-digit number)
67729959561018329193…78366191042026209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.354 × 10¹⁰⁴(105-digit number)
13545991912203665838…56732382084052418561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.709 × 10¹⁰⁴(105-digit number)
27091983824407331677…13464764168104837121
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,733,180 XPM·at block #6,811,133 · 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