Block #759,550

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/10/2014, 1:05:28 AM · Difficulty 10.9708 · 6,054,391 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4f1cf406330bb9b4e687c50c3c2c84ee6fc12fe7e2371aed12797a5725826653

Height

#759,550

Difficulty

10.970838

Transactions

2

Size

431 B

Version

2

Bits

0af888df

Nonce

38,657,657

Timestamp

10/10/2014, 1:05:28 AM

Confirmations

6,054,391

Merkle Root

246a74c5a5a9589f8899a71fab6b3871c915972762ffe18f82ed0a9b6db586dd
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.

6.593 × 10⁹⁴(95-digit number)
65939948010913322186…22680029234751606871
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
6.593 × 10⁹⁴(95-digit number)
65939948010913322186…22680029234751606871
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.318 × 10⁹⁵(96-digit number)
13187989602182664437…45360058469503213741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.637 × 10⁹⁵(96-digit number)
26375979204365328874…90720116939006427481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.275 × 10⁹⁵(96-digit number)
52751958408730657749…81440233878012854961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.055 × 10⁹⁶(97-digit number)
10550391681746131549…62880467756025709921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.110 × 10⁹⁶(97-digit number)
21100783363492263099…25760935512051419841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.220 × 10⁹⁶(97-digit number)
42201566726984526199…51521871024102839681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.440 × 10⁹⁶(97-digit number)
84403133453969052398…03043742048205679361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.688 × 10⁹⁷(98-digit number)
16880626690793810479…06087484096411358721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.376 × 10⁹⁷(98-digit number)
33761253381587620959…12174968192822717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.752 × 10⁹⁷(98-digit number)
67522506763175241918…24349936385645434881
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,755,605 XPM·at block #6,813,940 · 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