Block #364,390

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 1:12:44 AM · Difficulty 10.4210 · 6,442,503 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fbf4d632cc127452e969bac7705bc0a53624205225414c3fbb7c3932bec8c6b1

Height

#364,390

Difficulty

10.420974

Transactions

4

Size

875 B

Version

2

Bits

0a6bc4f2

Nonce

286,725

Timestamp

1/18/2014, 1:12:44 AM

Confirmations

6,442,503

Merkle Root

c64c18b16a2849661988eabe2de58ddbebe56d227daa5ecc36b81107e5740098
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.

8.069 × 10¹⁰²(103-digit number)
80692438628636032688…87494178756554830721
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
8.069 × 10¹⁰²(103-digit number)
80692438628636032688…87494178756554830721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.613 × 10¹⁰³(104-digit number)
16138487725727206537…74988357513109661441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.227 × 10¹⁰³(104-digit number)
32276975451454413075…49976715026219322881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.455 × 10¹⁰³(104-digit number)
64553950902908826151…99953430052438645761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.291 × 10¹⁰⁴(105-digit number)
12910790180581765230…99906860104877291521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.582 × 10¹⁰⁴(105-digit number)
25821580361163530460…99813720209754583041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.164 × 10¹⁰⁴(105-digit number)
51643160722327060920…99627440419509166081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.032 × 10¹⁰⁵(106-digit number)
10328632144465412184…99254880839018332161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.065 × 10¹⁰⁵(106-digit number)
20657264288930824368…98509761678036664321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.131 × 10¹⁰⁵(106-digit number)
41314528577861648736…97019523356073328641
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,699,252 XPM·at block #6,806,892 · 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