Block #364,689

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 6:08:31 AM · Difficulty 10.4210 · 6,452,580 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
91cbe98dc5fc386988e9aebde562527e72dd2648a6627a5975965055adab3326

Height

#364,689

Difficulty

10.420973

Transactions

6

Size

1.70 KB

Version

2

Bits

0a6bc4de

Nonce

21,697

Timestamp

1/18/2014, 6:08:31 AM

Confirmations

6,452,580

Merkle Root

6567ce5427b1693d0983103864aef9c8f33cf8fcf983acb73402e8e58605c66a
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.968 × 10⁹⁹(100-digit number)
19683029452482809929…39640423328077732241
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.968 × 10⁹⁹(100-digit number)
19683029452482809929…39640423328077732241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.936 × 10⁹⁹(100-digit number)
39366058904965619858…79280846656155464481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.873 × 10⁹⁹(100-digit number)
78732117809931239716…58561693312310928961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.574 × 10¹⁰⁰(101-digit number)
15746423561986247943…17123386624621857921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.149 × 10¹⁰⁰(101-digit number)
31492847123972495886…34246773249243715841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.298 × 10¹⁰⁰(101-digit number)
62985694247944991772…68493546498487431681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.259 × 10¹⁰¹(102-digit number)
12597138849588998354…36987092996974863361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.519 × 10¹⁰¹(102-digit number)
25194277699177996709…73974185993949726721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.038 × 10¹⁰¹(102-digit number)
50388555398355993418…47948371987899453441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.007 × 10¹⁰²(103-digit number)
10077711079671198683…95896743975798906881
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,782,189 XPM·at block #6,817,268 · 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