Block #279,295

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 7:27:58 AM · Difficulty 9.9713 · 6,536,577 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1e7ebabc4fb1fb5c3c3535e9940857758c4d73ac95cd1972767e0008f3367e55

Height

#279,295

Difficulty

9.971319

Transactions

11

Size

8.35 KB

Version

2

Bits

09f8a85c

Nonce

89,642

Timestamp

11/28/2013, 7:27:58 AM

Confirmations

6,536,577

Merkle Root

09588492d2ea708f0232cf1e60aacd95b8524fa7dfd06f690d96dcc11c8af9b3
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.

2.237 × 10⁹¹(92-digit number)
22377667541482075285…59596453217131503471
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
2.237 × 10⁹¹(92-digit number)
22377667541482075285…59596453217131503471
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.475 × 10⁹¹(92-digit number)
44755335082964150571…19192906434263006941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.951 × 10⁹¹(92-digit number)
89510670165928301142…38385812868526013881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.790 × 10⁹²(93-digit number)
17902134033185660228…76771625737052027761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.580 × 10⁹²(93-digit number)
35804268066371320456…53543251474104055521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.160 × 10⁹²(93-digit number)
71608536132742640913…07086502948208111041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.432 × 10⁹³(94-digit number)
14321707226548528182…14173005896416222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.864 × 10⁹³(94-digit number)
28643414453097056365…28346011792832444161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.728 × 10⁹³(94-digit number)
57286828906194112731…56692023585664888321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.145 × 10⁹⁴(95-digit number)
11457365781238822546…13384047171329776641
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,771,088 XPM·at block #6,815,871 · 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