Block #244,669

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/5/2013, 12:25:34 AM · Difficulty 9.9631 · 6,595,113 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd6e18a07e9ca7104f476fc8f6a57b6142cdd50cd6056ea72e37908fc4ca908d

Height

#244,669

Difficulty

9.963091

Transactions

2

Size

2.44 KB

Version

2

Bits

09f68d1b

Nonce

170,959

Timestamp

11/5/2013, 12:25:34 AM

Confirmations

6,595,113

Merkle Root

a3ec1a8ec7a44b337a90994caeb17f3197cf5fa9d758bfc8e50aee39e04586b0
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.911 × 10⁸⁹(90-digit number)
29114153606214134156…27480386693868054559
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.911 × 10⁸⁹(90-digit number)
29114153606214134156…27480386693868054559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.822 × 10⁸⁹(90-digit number)
58228307212428268312…54960773387736109119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.164 × 10⁹⁰(91-digit number)
11645661442485653662…09921546775472218239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.329 × 10⁹⁰(91-digit number)
23291322884971307325…19843093550944436479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.658 × 10⁹⁰(91-digit number)
46582645769942614650…39686187101888872959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.316 × 10⁹⁰(91-digit number)
93165291539885229300…79372374203777745919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.863 × 10⁹¹(92-digit number)
18633058307977045860…58744748407555491839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.726 × 10⁹¹(92-digit number)
37266116615954091720…17489496815110983679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.453 × 10⁹¹(92-digit number)
74532233231908183440…34978993630221967359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.490 × 10⁹²(93-digit number)
14906446646381636688…69957987260443934719
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,962,546 XPM·at block #6,839,781 · 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