Block #250,448

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/8/2013, 12:23:53 PM · Difficulty 9.9683 · 6,589,225 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0e70dbc7ac3c03f06f7b6561abd753e0e5f3af6c0c26d18cb4f9a71c7782bebf

Height

#250,448

Difficulty

9.968337

Transactions

2

Size

391 B

Version

2

Bits

09f7e4e7

Nonce

1,802

Timestamp

11/8/2013, 12:23:53 PM

Confirmations

6,589,225

Merkle Root

3fca9c60ad42c775ffa72e2eef9f2b96db567091dc6e1c85823a00f66d22e68c
Transactions (2)
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.891 × 10⁹⁶(97-digit number)
18916026564855934879…03847869714278502401
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.891 × 10⁹⁶(97-digit number)
18916026564855934879…03847869714278502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.783 × 10⁹⁶(97-digit number)
37832053129711869759…07695739428557004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.566 × 10⁹⁶(97-digit number)
75664106259423739519…15391478857114009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.513 × 10⁹⁷(98-digit number)
15132821251884747903…30782957714228019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.026 × 10⁹⁷(98-digit number)
30265642503769495807…61565915428456038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.053 × 10⁹⁷(98-digit number)
60531285007538991615…23131830856912076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.210 × 10⁹⁸(99-digit number)
12106257001507798323…46263661713824153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.421 × 10⁹⁸(99-digit number)
24212514003015596646…92527323427648307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.842 × 10⁹⁸(99-digit number)
48425028006031193292…85054646855296614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.685 × 10⁹⁸(99-digit number)
96850056012062386585…70109293710593228801
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,961,673 XPM·at block #6,839,672 · 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