Block #363,150

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 5:22:02 AM · Difficulty 10.4138 · 6,447,775 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f30e72141e783f7e67e0259e046bb69075a38638de162eb4a25da3453ad0fbc3

Height

#363,150

Difficulty

10.413794

Transactions

5

Size

1.08 KB

Version

2

Bits

0a69ee66

Nonce

179,775

Timestamp

1/17/2014, 5:22:02 AM

Confirmations

6,447,775

Merkle Root

6c59fea2451dd726827df32b5436b7d50247035332d3402eb3eb2b496aa71e56
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.295 × 10⁹⁸(99-digit number)
12959024692076176031…71419095130960138241
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.295 × 10⁹⁸(99-digit number)
12959024692076176031…71419095130960138241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.591 × 10⁹⁸(99-digit number)
25918049384152352063…42838190261920276481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.183 × 10⁹⁸(99-digit number)
51836098768304704127…85676380523840552961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.036 × 10⁹⁹(100-digit number)
10367219753660940825…71352761047681105921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.073 × 10⁹⁹(100-digit number)
20734439507321881651…42705522095362211841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.146 × 10⁹⁹(100-digit number)
41468879014643763302…85411044190724423681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.293 × 10⁹⁹(100-digit number)
82937758029287526604…70822088381448847361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.658 × 10¹⁰⁰(101-digit number)
16587551605857505320…41644176762897694721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.317 × 10¹⁰⁰(101-digit number)
33175103211715010641…83288353525795389441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.635 × 10¹⁰⁰(101-digit number)
66350206423430021283…66576707051590778881
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,731,502 XPM·at block #6,810,924 · 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