Block #278,729

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 2:34:36 AM · Difficulty 9.9697 · 6,530,003 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f82695e8e94187d4ce04bba727921f0466e0bc0f7d60b2f1362896e8e6b48cd4

Height

#278,729

Difficulty

9.969703

Transactions

13

Size

5.42 KB

Version

2

Bits

09f83e75

Nonce

64,244

Timestamp

11/28/2013, 2:34:36 AM

Confirmations

6,530,003

Merkle Root

2f07449cc6d594ac1d5330565249237d69ec25f7cf08a34ed877514434cf2242
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.063 × 10⁹⁷(98-digit number)
40637083292014875914…67309493975617382401
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.063 × 10⁹⁷(98-digit number)
40637083292014875914…67309493975617382401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.127 × 10⁹⁷(98-digit number)
81274166584029751829…34618987951234764801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.625 × 10⁹⁸(99-digit number)
16254833316805950365…69237975902469529601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.250 × 10⁹⁸(99-digit number)
32509666633611900731…38475951804939059201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.501 × 10⁹⁸(99-digit number)
65019333267223801463…76951903609878118401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.300 × 10⁹⁹(100-digit number)
13003866653444760292…53903807219756236801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.600 × 10⁹⁹(100-digit number)
26007733306889520585…07807614439512473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.201 × 10⁹⁹(100-digit number)
52015466613779041171…15615228879024947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.040 × 10¹⁰⁰(101-digit number)
10403093322755808234…31230457758049894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.080 × 10¹⁰⁰(101-digit number)
20806186645511616468…62460915516099788801
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,902 XPM·at block #6,808,731 · 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