Block #728,255

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/18/2014, 9:42:08 PM · Difficulty 10.9641 · 6,080,646 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1e28cd665bf54eba1b4932a3d6dcd5741596eeb52addaa81822d94a933351c64

Height

#728,255

Difficulty

10.964143

Transactions

3

Size

659 B

Version

2

Bits

0af6d20d

Nonce

48,246,913

Timestamp

9/18/2014, 9:42:08 PM

Confirmations

6,080,646

Merkle Root

1ec69cfc7036e591d30b60c990d0de09bc5ae6003ff7ca0bc87359615a2360eb
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.001 × 10⁹⁷(98-digit number)
10018792293894369342…30367126671552624001
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.001 × 10⁹⁷(98-digit number)
10018792293894369342…30367126671552624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.003 × 10⁹⁷(98-digit number)
20037584587788738685…60734253343105248001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.007 × 10⁹⁷(98-digit number)
40075169175577477371…21468506686210496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.015 × 10⁹⁷(98-digit number)
80150338351154954743…42937013372420992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.603 × 10⁹⁸(99-digit number)
16030067670230990948…85874026744841984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.206 × 10⁹⁸(99-digit number)
32060135340461981897…71748053489683968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.412 × 10⁹⁸(99-digit number)
64120270680923963794…43496106979367936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.282 × 10⁹⁹(100-digit number)
12824054136184792758…86992213958735872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.564 × 10⁹⁹(100-digit number)
25648108272369585517…73984427917471744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.129 × 10⁹⁹(100-digit number)
51296216544739171035…47968855834943488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.025 × 10¹⁰⁰(101-digit number)
10259243308947834207…95937711669886976001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,715,261 XPM·at block #6,808,900 · 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