Block #235,764

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/31/2013, 3:24:39 AM · Difficulty 9.9459 · 6,581,099 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e855b91c3e7efa032a3363dff9ed15eacd1a6a690841cd1f8e1133b03055416c

Height

#235,764

Difficulty

9.945898

Transactions

3

Size

612 B

Version

2

Bits

09f22664

Nonce

67,798

Timestamp

10/31/2013, 3:24:39 AM

Confirmations

6,581,099

Merkle Root

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

4.765 × 10⁹⁹(100-digit number)
47654757179818141676…21981904860327430321
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
4.765 × 10⁹⁹(100-digit number)
47654757179818141676…21981904860327430321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.530 × 10⁹⁹(100-digit number)
95309514359636283352…43963809720654860641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.906 × 10¹⁰⁰(101-digit number)
19061902871927256670…87927619441309721281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.812 × 10¹⁰⁰(101-digit number)
38123805743854513340…75855238882619442561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.624 × 10¹⁰⁰(101-digit number)
76247611487709026681…51710477765238885121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.524 × 10¹⁰¹(102-digit number)
15249522297541805336…03420955530477770241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.049 × 10¹⁰¹(102-digit number)
30499044595083610672…06841911060955540481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.099 × 10¹⁰¹(102-digit number)
60998089190167221345…13683822121911080961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.219 × 10¹⁰²(103-digit number)
12199617838033444269…27367644243822161921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.439 × 10¹⁰²(103-digit number)
24399235676066888538…54735288487644323841
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,778,948 XPM·at block #6,816,862 · 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