Block #357,301

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 8:00:27 AM · Difficulty 10.3830 · 6,456,716 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
163724fbf9c92e651d1f65a6e37b9b520846bc4aba808c6fd7aa71860c3d1ae9

Height

#357,301

Difficulty

10.383025

Transactions

8

Size

1.74 KB

Version

2

Bits

0a620df4

Nonce

6,315

Timestamp

1/13/2014, 8:00:27 AM

Confirmations

6,456,716

Merkle Root

ae29dcb942486f18c1e4b9a726466a2a710f20b9c559dd3d6085555d2daa81c7
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.655 × 10⁹¹(92-digit number)
16554632944730304269…70208087934579524801
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.655 × 10⁹¹(92-digit number)
16554632944730304269…70208087934579524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.310 × 10⁹¹(92-digit number)
33109265889460608538…40416175869159049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.621 × 10⁹¹(92-digit number)
66218531778921217076…80832351738318099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.324 × 10⁹²(93-digit number)
13243706355784243415…61664703476636198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.648 × 10⁹²(93-digit number)
26487412711568486830…23329406953272396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.297 × 10⁹²(93-digit number)
52974825423136973661…46658813906544793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.059 × 10⁹³(94-digit number)
10594965084627394732…93317627813089587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.118 × 10⁹³(94-digit number)
21189930169254789464…86635255626179174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.237 × 10⁹³(94-digit number)
42379860338509578929…73270511252358348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.475 × 10⁹³(94-digit number)
84759720677019157858…46541022504716697601
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,756,220 XPM·at block #6,814,016 · 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