Block #242,137

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/3/2013, 2:32:12 PM · Difficulty 9.9591 · 6,566,446 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf7a8feb72ea888f5346d9b603a88dce364f7419b065499bd1c0cd918d485410

Height

#242,137

Difficulty

9.959134

Transactions

2

Size

1.03 KB

Version

2

Bits

09f589cb

Nonce

3,618

Timestamp

11/3/2013, 2:32:12 PM

Confirmations

6,566,446

Merkle Root

e5d7260d841a33ab248912293df3e54adf8ba091a7a609a2425ae6008646de4c
Transactions (2)
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.

1.338 × 10¹⁰⁰(101-digit number)
13389725940738085733…54869606162503372799
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
1.338 × 10¹⁰⁰(101-digit number)
13389725940738085733…54869606162503372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.677 × 10¹⁰⁰(101-digit number)
26779451881476171466…09739212325006745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.355 × 10¹⁰⁰(101-digit number)
53558903762952342933…19478424650013491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.071 × 10¹⁰¹(102-digit number)
10711780752590468586…38956849300026982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.142 × 10¹⁰¹(102-digit number)
21423561505180937173…77913698600053964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.284 × 10¹⁰¹(102-digit number)
42847123010361874346…55827397200107929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.569 × 10¹⁰¹(102-digit number)
85694246020723748693…11654794400215859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.713 × 10¹⁰²(103-digit number)
17138849204144749738…23309588800431718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.427 × 10¹⁰²(103-digit number)
34277698408289499477…46619177600863436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.855 × 10¹⁰²(103-digit number)
68555396816578998954…93238355201726873599
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,712,721 XPM·at block #6,808,582 · 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