Block #293,561

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/4/2013, 9:26:31 AM · Difficulty 9.9907 · 6,550,547 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4c3a2443404eea86bd5fc12952b4c14b90d4f4c267b8b5391bf3b79b062c1f61

Height

#293,561

Difficulty

9.990683

Transactions

1

Size

867 B

Version

2

Bits

09fd9d62

Nonce

114,318

Timestamp

12/4/2013, 9:26:31 AM

Confirmations

6,550,547

Merkle Root

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

6.564 × 10⁹⁵(96-digit number)
65642039863691985167…74339910240893050879
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
6.564 × 10⁹⁵(96-digit number)
65642039863691985167…74339910240893050879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.312 × 10⁹⁶(97-digit number)
13128407972738397033…48679820481786101759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.625 × 10⁹⁶(97-digit number)
26256815945476794067…97359640963572203519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.251 × 10⁹⁶(97-digit number)
52513631890953588134…94719281927144407039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.050 × 10⁹⁷(98-digit number)
10502726378190717626…89438563854288814079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.100 × 10⁹⁷(98-digit number)
21005452756381435253…78877127708577628159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.201 × 10⁹⁷(98-digit number)
42010905512762870507…57754255417155256319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.402 × 10⁹⁷(98-digit number)
84021811025525741014…15508510834310512639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.680 × 10⁹⁸(99-digit number)
16804362205105148202…31017021668621025279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.360 × 10⁹⁸(99-digit number)
33608724410210296405…62034043337242050559
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,997,237 XPM·at block #6,844,107 · 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