Block #313,460

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 11:53:21 AM · Difficulty 10.0065 · 6,501,591 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd7c94c70a5aa7b739b37453bf6bed026f8783c537e9d6ae45b4af0358bbf5bc

Height

#313,460

Difficulty

10.006473

Transactions

11

Size

8.76 KB

Version

2

Bits

0a01a832

Nonce

94,589

Timestamp

12/15/2013, 11:53:21 AM

Confirmations

6,501,591

Merkle Root

f9c337cdaa6a3b95cf5d078bc9e5519a1180070618947d6c16516e254e34f966
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.444 × 10⁹⁴(95-digit number)
14444866102051618280…75635132741043010241
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.444 × 10⁹⁴(95-digit number)
14444866102051618280…75635132741043010241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.888 × 10⁹⁴(95-digit number)
28889732204103236561…51270265482086020481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.777 × 10⁹⁴(95-digit number)
57779464408206473123…02540530964172040961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.155 × 10⁹⁵(96-digit number)
11555892881641294624…05081061928344081921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.311 × 10⁹⁵(96-digit number)
23111785763282589249…10162123856688163841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.622 × 10⁹⁵(96-digit number)
46223571526565178499…20324247713376327681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.244 × 10⁹⁵(96-digit number)
92447143053130356998…40648495426752655361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.848 × 10⁹⁶(97-digit number)
18489428610626071399…81296990853505310721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.697 × 10⁹⁶(97-digit number)
36978857221252142799…62593981707010621441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.395 × 10⁹⁶(97-digit number)
73957714442504285598…25187963414021242881
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,764,499 XPM·at block #6,815,050 · 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