Block #364,436

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 1:54:52 AM · Difficulty 10.4211 · 6,472,114 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
610d096ddf538a11c56b8560f7b953a04aafefc44e787d2cc17d3dd4b69669d8

Height

#364,436

Difficulty

10.421115

Transactions

5

Size

1.54 KB

Version

2

Bits

0a6bce36

Nonce

103,410

Timestamp

1/18/2014, 1:54:52 AM

Confirmations

6,472,114

Merkle Root

9b9396cb04c85a155f293225f889c2866ffe3a708d0d11e5fcdd70882aab93ba
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.107 × 10¹⁰⁰(101-digit number)
31073455146048441805…40798270798160246921
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.107 × 10¹⁰⁰(101-digit number)
31073455146048441805…40798270798160246921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.214 × 10¹⁰⁰(101-digit number)
62146910292096883610…81596541596320493841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.242 × 10¹⁰¹(102-digit number)
12429382058419376722…63193083192640987681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.485 × 10¹⁰¹(102-digit number)
24858764116838753444…26386166385281975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.971 × 10¹⁰¹(102-digit number)
49717528233677506888…52772332770563950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.943 × 10¹⁰¹(102-digit number)
99435056467355013777…05544665541127901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.988 × 10¹⁰²(103-digit number)
19887011293471002755…11089331082255802881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.977 × 10¹⁰²(103-digit number)
39774022586942005511…22178662164511605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.954 × 10¹⁰²(103-digit number)
79548045173884011022…44357324329023211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.590 × 10¹⁰³(104-digit number)
15909609034776802204…88714648658046423041
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,936,664 XPM·at block #6,836,549 · 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