Block #311,971

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 7:33:35 PM · Difficulty 9.9957 · 6,513,603 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bff5fc190a2275ed04b21e0f7adc22aba5e030cadc580e4faeecde5902eda34b

Height

#311,971

Difficulty

9.995656

Transactions

1

Size

832 B

Version

2

Bits

09fee34c

Nonce

56,608

Timestamp

12/14/2013, 7:33:35 PM

Confirmations

6,513,603

Merkle Root

6fb3e49b0b9cac7e910f3dfebe90aaa8326ae754da3e599bded6cc3b08dc8748
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.385 × 10⁹²(93-digit number)
13855150746235188096…67689616515195831041
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.385 × 10⁹²(93-digit number)
13855150746235188096…67689616515195831041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.771 × 10⁹²(93-digit number)
27710301492470376192…35379233030391662081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.542 × 10⁹²(93-digit number)
55420602984940752385…70758466060783324161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.108 × 10⁹³(94-digit number)
11084120596988150477…41516932121566648321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.216 × 10⁹³(94-digit number)
22168241193976300954…83033864243133296641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.433 × 10⁹³(94-digit number)
44336482387952601908…66067728486266593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.867 × 10⁹³(94-digit number)
88672964775905203817…32135456972533186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.773 × 10⁹⁴(95-digit number)
17734592955181040763…64270913945066373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.546 × 10⁹⁴(95-digit number)
35469185910362081526…28541827890132746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.093 × 10⁹⁴(95-digit number)
70938371820724163053…57083655780265492481
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,848,692 XPM·at block #6,825,573 · 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