Block #278,953

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 4:37:23 AM · Difficulty 9.9703 · 6,537,267 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c85414989db9cb594fc7f0d6abb72132312e7e415d8f9161cb601a1f0e9d3eb9

Height

#278,953

Difficulty

9.970306

Transactions

4

Size

911 B

Version

2

Bits

09f865fa

Nonce

5,805

Timestamp

11/28/2013, 4:37:23 AM

Confirmations

6,537,267

Merkle Root

9b2851a57a94c23306c23608bfff3e234cda6f2ea0657d9f1bae323cee4aba2e
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.055 × 10¹⁰⁴(105-digit number)
80552546071584578555…42921727625565836801
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.055 × 10¹⁰⁴(105-digit number)
80552546071584578555…42921727625565836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.611 × 10¹⁰⁵(106-digit number)
16110509214316915711…85843455251131673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.222 × 10¹⁰⁵(106-digit number)
32221018428633831422…71686910502263347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.444 × 10¹⁰⁵(106-digit number)
64442036857267662844…43373821004526694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.288 × 10¹⁰⁶(107-digit number)
12888407371453532568…86747642009053388801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.577 × 10¹⁰⁶(107-digit number)
25776814742907065137…73495284018106777601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.155 × 10¹⁰⁶(107-digit number)
51553629485814130275…46990568036213555201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.031 × 10¹⁰⁷(108-digit number)
10310725897162826055…93981136072427110401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.062 × 10¹⁰⁷(108-digit number)
20621451794325652110…87962272144854220801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.124 × 10¹⁰⁷(108-digit number)
41242903588651304220…75924544289708441601
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,773,889 XPM·at block #6,816,219 · 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