Block #235,785

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/31/2013, 3:41:15 AM · Difficulty 9.9460 · 6,582,065 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
17f17ef09a088a97289ade13dff374488cefc83bcb8ea3919a54b1a25a51c2bb

Height

#235,785

Difficulty

9.945955

Transactions

1

Size

2.11 KB

Version

2

Bits

09f22a22

Nonce

297,814

Timestamp

10/31/2013, 3:41:15 AM

Confirmations

6,582,065

Merkle Root

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

2.568 × 10⁹¹(92-digit number)
25688646443997914556…11435031435296115841
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
2.568 × 10⁹¹(92-digit number)
25688646443997914556…11435031435296115841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.137 × 10⁹¹(92-digit number)
51377292887995829112…22870062870592231681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.027 × 10⁹²(93-digit number)
10275458577599165822…45740125741184463361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.055 × 10⁹²(93-digit number)
20550917155198331645…91480251482368926721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.110 × 10⁹²(93-digit number)
41101834310396663290…82960502964737853441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.220 × 10⁹²(93-digit number)
82203668620793326580…65921005929475706881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.644 × 10⁹³(94-digit number)
16440733724158665316…31842011858951413761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.288 × 10⁹³(94-digit number)
32881467448317330632…63684023717902827521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.576 × 10⁹³(94-digit number)
65762934896634661264…27368047435805655041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.315 × 10⁹⁴(95-digit number)
13152586979326932252…54736094871611310081
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,786,866 XPM·at block #6,817,849 · 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