Block #269,753

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/23/2013, 10:28:44 AM · Difficulty 9.9523 · 6,556,805 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
42193e901d841744642b76586c9b7890b917c61297a951fef871331f16aa8152

Height

#269,753

Difficulty

9.952275

Transactions

1

Size

2.07 KB

Version

2

Bits

09f3c84f

Nonce

91,006

Timestamp

11/23/2013, 10:28:44 AM

Confirmations

6,556,805

Merkle Root

c06e6faa05bb10be93c9f8c85ffcbb0e660368d4fd525ff7715546c2a03a778e
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.118 × 10⁸⁹(90-digit number)
11183633545186373668…67778027908721303219
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.118 × 10⁸⁹(90-digit number)
11183633545186373668…67778027908721303219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.236 × 10⁸⁹(90-digit number)
22367267090372747337…35556055817442606439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.473 × 10⁸⁹(90-digit number)
44734534180745494675…71112111634885212879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.946 × 10⁸⁹(90-digit number)
89469068361490989351…42224223269770425759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.789 × 10⁹⁰(91-digit number)
17893813672298197870…84448446539540851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.578 × 10⁹⁰(91-digit number)
35787627344596395740…68896893079081703039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.157 × 10⁹⁰(91-digit number)
71575254689192791481…37793786158163406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.431 × 10⁹¹(92-digit number)
14315050937838558296…75587572316326812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.863 × 10⁹¹(92-digit number)
28630101875677116592…51175144632653624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.726 × 10⁹¹(92-digit number)
57260203751354233185…02350289265307248639
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,856,615 XPM·at block #6,826,557 · 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