Block #360,153

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2014, 6:39:07 AM · Difficulty 10.3905 · 6,448,564 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ebfc1afd194aa6a2c21bc8269430034bdc8abb20d0ce5e74802f0421cf7c2987

Height

#360,153

Difficulty

10.390451

Transactions

2

Size

19.73 KB

Version

2

Bits

0a63f49c

Nonce

93,070

Timestamp

1/15/2014, 6:39:07 AM

Confirmations

6,448,564

Merkle Root

2a773286050b5e325ab7b3380db3bf7abba2f3efaa61c5f250500a10030e9a82
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.

4.255 × 10⁹³(94-digit number)
42557686913427290762…79129229189971811201
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
4.255 × 10⁹³(94-digit number)
42557686913427290762…79129229189971811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.511 × 10⁹³(94-digit number)
85115373826854581524…58258458379943622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.702 × 10⁹⁴(95-digit number)
17023074765370916304…16516916759887244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.404 × 10⁹⁴(95-digit number)
34046149530741832609…33033833519774489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.809 × 10⁹⁴(95-digit number)
68092299061483665219…66067667039548979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.361 × 10⁹⁵(96-digit number)
13618459812296733043…32135334079097958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.723 × 10⁹⁵(96-digit number)
27236919624593466087…64270668158195916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.447 × 10⁹⁵(96-digit number)
54473839249186932175…28541336316391833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.089 × 10⁹⁶(97-digit number)
10894767849837386435…57082672632783667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.178 × 10⁹⁶(97-digit number)
21789535699674772870…14165345265567334401
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,713,781 XPM·at block #6,808,716 · 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