Block #243,390

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/4/2013, 6:50:17 AM · Difficulty 9.9614 · 6,593,204 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eed8c0b058372e00b43950509fdab2f04263f43567a3a49a6ecb4d328a1934be

Height

#243,390

Difficulty

9.961374

Transactions

1

Size

1.64 KB

Version

2

Bits

09f61ca0

Nonce

124,160

Timestamp

11/4/2013, 6:50:17 AM

Confirmations

6,593,204

Merkle Root

77f00fa5c80d1c009e34af990e2b02eb479649061d0d3129243094537d098afc
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.732 × 10⁹²(93-digit number)
27329143405977248233…84573527945286942719
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.732 × 10⁹²(93-digit number)
27329143405977248233…84573527945286942719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.465 × 10⁹²(93-digit number)
54658286811954496467…69147055890573885439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.093 × 10⁹³(94-digit number)
10931657362390899293…38294111781147770879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.186 × 10⁹³(94-digit number)
21863314724781798586…76588223562295541759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.372 × 10⁹³(94-digit number)
43726629449563597173…53176447124591083519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.745 × 10⁹³(94-digit number)
87453258899127194347…06352894249182167039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.749 × 10⁹⁴(95-digit number)
17490651779825438869…12705788498364334079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.498 × 10⁹⁴(95-digit number)
34981303559650877739…25411576996728668159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.996 × 10⁹⁴(95-digit number)
69962607119301755478…50823153993457336319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.399 × 10⁹⁵(96-digit number)
13992521423860351095…01646307986914672639
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,937,022 XPM·at block #6,836,593 · 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