Block #279,799

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 11:26:33 AM · Difficulty 9.9728 · 6,529,324 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1fdf5e774ef497d0f6d7d2bd6e32a44a783aa816f3cc5c82e42df68f664f8e87

Height

#279,799

Difficulty

9.972803

Transactions

2

Size

574 B

Version

2

Bits

09f909a2

Nonce

14,476

Timestamp

11/28/2013, 11:26:33 AM

Confirmations

6,529,324

Merkle Root

430ea418f9324e1154fadbb275a986194a5e2d0bf9b33f6f66e023ff938b7af3
Transactions (2)
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.146 × 10¹⁰¹(102-digit number)
11467906356020376168…29772992417814824961
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.146 × 10¹⁰¹(102-digit number)
11467906356020376168…29772992417814824961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.293 × 10¹⁰¹(102-digit number)
22935812712040752336…59545984835629649921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.587 × 10¹⁰¹(102-digit number)
45871625424081504672…19091969671259299841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.174 × 10¹⁰¹(102-digit number)
91743250848163009344…38183939342518599681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.834 × 10¹⁰²(103-digit number)
18348650169632601868…76367878685037199361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.669 × 10¹⁰²(103-digit number)
36697300339265203737…52735757370074398721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.339 × 10¹⁰²(103-digit number)
73394600678530407475…05471514740148797441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.467 × 10¹⁰³(104-digit number)
14678920135706081495…10943029480297594881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.935 × 10¹⁰³(104-digit number)
29357840271412162990…21886058960595189761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.871 × 10¹⁰³(104-digit number)
58715680542824325980…43772117921190379521
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,717,042 XPM·at block #6,809,122 · 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