Block #257,919

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/12/2013, 6:20:52 PM · Difficulty 9.9760 · 6,558,778 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d99d83b7cacb4830e5e41a6180a208d0b1afee00a7ef785c57d2262c0dbae55b

Height

#257,919

Difficulty

9.976015

Transactions

3

Size

4.64 KB

Version

2

Bits

09f9dc22

Nonce

35,341

Timestamp

11/12/2013, 6:20:52 PM

Confirmations

6,558,778

Merkle Root

3f06cb18aacb62b838cfa3d5e04dad8c17b0d073faf800bd2748bbc251c8eef6
Transactions (3)
28 in → 1 out222.0000 XPM4.09 KB
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.

9.232 × 10⁹⁴(95-digit number)
92324172208583751767…97372597340484853121
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
9.232 × 10⁹⁴(95-digit number)
92324172208583751767…97372597340484853121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.846 × 10⁹⁵(96-digit number)
18464834441716750353…94745194680969706241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.692 × 10⁹⁵(96-digit number)
36929668883433500707…89490389361939412481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.385 × 10⁹⁵(96-digit number)
73859337766867001414…78980778723878824961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.477 × 10⁹⁶(97-digit number)
14771867553373400282…57961557447757649921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.954 × 10⁹⁶(97-digit number)
29543735106746800565…15923114895515299841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.908 × 10⁹⁶(97-digit number)
59087470213493601131…31846229791030599681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.181 × 10⁹⁷(98-digit number)
11817494042698720226…63692459582061199361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.363 × 10⁹⁷(98-digit number)
23634988085397440452…27384919164122398721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.726 × 10⁹⁷(98-digit number)
47269976170794880905…54769838328244797441
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,777,698 XPM·at block #6,816,696 · 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