Block #241,491

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/3/2013, 6:04:45 AM · Difficulty 9.9580 · 6,589,509 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2f92f59eb2a36a1472dd9685175dd37ad6ae8b0bd71e803ab27c2d7b551ee7f

Height

#241,491

Difficulty

9.957957

Transactions

1

Size

1.81 KB

Version

2

Bits

09f53ca9

Nonce

93,920

Timestamp

11/3/2013, 6:04:45 AM

Confirmations

6,589,509

Merkle Root

5fa9083208f23da327455820bfbdd45147883ada5db85e3d8800d48a4bbb640e
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.

3.243 × 10⁹⁰(91-digit number)
32437439937764427974…95291987844535748269
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
3.243 × 10⁹⁰(91-digit number)
32437439937764427974…95291987844535748269
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.487 × 10⁹⁰(91-digit number)
64874879875528855949…90583975689071496539
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.297 × 10⁹¹(92-digit number)
12974975975105771189…81167951378142993079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.594 × 10⁹¹(92-digit number)
25949951950211542379…62335902756285986159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.189 × 10⁹¹(92-digit number)
51899903900423084759…24671805512571972319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.037 × 10⁹²(93-digit number)
10379980780084616951…49343611025143944639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.075 × 10⁹²(93-digit number)
20759961560169233903…98687222050287889279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.151 × 10⁹²(93-digit number)
41519923120338467807…97374444100575778559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.303 × 10⁹²(93-digit number)
83039846240676935615…94748888201151557119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.660 × 10⁹³(94-digit number)
16607969248135387123…89497776402303114239
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,892,140 XPM·at block #6,830,999 · 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