Block #278,572

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2013, 1:01:28 AM · Difficulty 9.9693 · 6,535,616 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
812bac7a0b431458435168b8a519c1efd5f087124a27337b67438750c409639d

Height

#278,572

Difficulty

9.969319

Transactions

4

Size

1.81 KB

Version

2

Bits

09f82552

Nonce

40,979

Timestamp

11/28/2013, 1:01:28 AM

Confirmations

6,535,616

Merkle Root

af00eccd153f42d2485066be6fd5cb7742357518f7c65237ef41503dd9566671
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.

7.156 × 10⁹⁶(97-digit number)
71569371743793534786…90385332433132992001
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
7.156 × 10⁹⁶(97-digit number)
71569371743793534786…90385332433132992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.431 × 10⁹⁷(98-digit number)
14313874348758706957…80770664866265984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.862 × 10⁹⁷(98-digit number)
28627748697517413914…61541329732531968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.725 × 10⁹⁷(98-digit number)
57255497395034827829…23082659465063936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.145 × 10⁹⁸(99-digit number)
11451099479006965565…46165318930127872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.290 × 10⁹⁸(99-digit number)
22902198958013931131…92330637860255744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.580 × 10⁹⁸(99-digit number)
45804397916027862263…84661275720511488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.160 × 10⁹⁸(99-digit number)
91608795832055724526…69322551441022976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.832 × 10⁹⁹(100-digit number)
18321759166411144905…38645102882045952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.664 × 10⁹⁹(100-digit number)
36643518332822289810…77290205764091904001
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,757,577 XPM·at block #6,814,187 · 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