Block #755,111

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/7/2014, 5:50:37 AM · Difficulty 10.9683 · 6,052,707 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5279716c910312ba424edfaf8269879a686b5341d0a6e58e77c90191e2129499

Height

#755,111

Difficulty

10.968271

Transactions

7

Size

4.27 KB

Version

2

Bits

0af7e09f

Nonce

3,062,356,458

Timestamp

10/7/2014, 5:50:37 AM

Confirmations

6,052,707

Merkle Root

d8bb0c2df1e2f2a62c5d3906503e88d3807f7fede4201e1f4daf0a7e578aebdf
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.

5.357 × 10⁹³(94-digit number)
53572862874553744048…93273452392779323961
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
5.357 × 10⁹³(94-digit number)
53572862874553744048…93273452392779323961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.071 × 10⁹⁴(95-digit number)
10714572574910748809…86546904785558647921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.142 × 10⁹⁴(95-digit number)
21429145149821497619…73093809571117295841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.285 × 10⁹⁴(95-digit number)
42858290299642995238…46187619142234591681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.571 × 10⁹⁴(95-digit number)
85716580599285990477…92375238284469183361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.714 × 10⁹⁵(96-digit number)
17143316119857198095…84750476568938366721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.428 × 10⁹⁵(96-digit number)
34286632239714396191…69500953137876733441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.857 × 10⁹⁵(96-digit number)
68573264479428792382…39001906275753466881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.371 × 10⁹⁶(97-digit number)
13714652895885758476…78003812551506933761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.742 × 10⁹⁶(97-digit number)
27429305791771516952…56007625103013867521
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,706,579 XPM·at block #6,807,817 · 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