Block #276,271

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 2:38:56 AM · Difficulty 9.9628 · 6,533,420 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
60c5a3a79eda22919be1a7b2509edbd714c13edd43d299d2df0c657cd7a238c5

Height

#276,271

Difficulty

9.962792

Transactions

1

Size

1002 B

Version

2

Bits

09f67989

Nonce

370,176

Timestamp

11/27/2013, 2:38:56 AM

Confirmations

6,533,420

Merkle Root

6c8165f9f0a9160c5a280b63361d9c4fce2efa25033754d2fba5a7d5e5b1871a
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.

3.854 × 10⁹²(93-digit number)
38549680212102859690…67284988623513143201
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
3.854 × 10⁹²(93-digit number)
38549680212102859690…67284988623513143201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.709 × 10⁹²(93-digit number)
77099360424205719381…34569977247026286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.541 × 10⁹³(94-digit number)
15419872084841143876…69139954494052572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.083 × 10⁹³(94-digit number)
30839744169682287752…38279908988105145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.167 × 10⁹³(94-digit number)
61679488339364575505…76559817976210291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.233 × 10⁹⁴(95-digit number)
12335897667872915101…53119635952420582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.467 × 10⁹⁴(95-digit number)
24671795335745830202…06239271904841164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.934 × 10⁹⁴(95-digit number)
49343590671491660404…12478543809682329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.868 × 10⁹⁴(95-digit number)
98687181342983320808…24957087619364659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.973 × 10⁹⁵(96-digit number)
19737436268596664161…49914175238729318401
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,721,604 XPM·at block #6,809,690 · 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