Block #231,760

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/28/2013, 4:33:26 PM · Difficulty 9.9404 · 6,577,612 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e5539b2440d757ff72c5e120ae4971006fe6dc8d6892b371de056f5ae79986d3

Height

#231,760

Difficulty

9.940408

Transactions

5

Size

1.21 KB

Version

2

Bits

09f0be94

Nonce

44,449

Timestamp

10/28/2013, 4:33:26 PM

Confirmations

6,577,612

Merkle Root

b4845fc913e752d8500b8956157984cbbccc47b1fecd0aa233afd070b44c547f
Transactions (5)
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.

4.979 × 10⁹¹(92-digit number)
49793689241715797590…58218600750715757279
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
4.979 × 10⁹¹(92-digit number)
49793689241715797590…58218600750715757279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.958 × 10⁹¹(92-digit number)
99587378483431595181…16437201501431514559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.991 × 10⁹²(93-digit number)
19917475696686319036…32874403002863029119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.983 × 10⁹²(93-digit number)
39834951393372638072…65748806005726058239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.966 × 10⁹²(93-digit number)
79669902786745276144…31497612011452116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.593 × 10⁹³(94-digit number)
15933980557349055228…62995224022904232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.186 × 10⁹³(94-digit number)
31867961114698110457…25990448045808465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.373 × 10⁹³(94-digit number)
63735922229396220915…51980896091616931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.274 × 10⁹⁴(95-digit number)
12747184445879244183…03961792183233863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.549 × 10⁹⁴(95-digit number)
25494368891758488366…07923584366467727359
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,719,045 XPM·at block #6,809,371 · 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