Block #165,758

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/15/2013, 12:04:00 PM · Difficulty 9.8663 · 6,658,873 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
56fe3e813a4dcbb7be3acaad8c2a4f72924f36e1acf6391c1b0803b1f2ddb1ab

Height

#165,758

Difficulty

9.866292

Transactions

6

Size

2.56 KB

Version

2

Bits

09ddc54d

Nonce

178,927

Timestamp

9/15/2013, 12:04:00 PM

Confirmations

6,658,873

Merkle Root

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

3.844 × 10⁹³(94-digit number)
38443169910592127545…96191726604514414079
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
3.844 × 10⁹³(94-digit number)
38443169910592127545…96191726604514414079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.688 × 10⁹³(94-digit number)
76886339821184255090…92383453209028828159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.537 × 10⁹⁴(95-digit number)
15377267964236851018…84766906418057656319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.075 × 10⁹⁴(95-digit number)
30754535928473702036…69533812836115312639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.150 × 10⁹⁴(95-digit number)
61509071856947404072…39067625672230625279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.230 × 10⁹⁵(96-digit number)
12301814371389480814…78135251344461250559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.460 × 10⁹⁵(96-digit number)
24603628742778961628…56270502688922501119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.920 × 10⁹⁵(96-digit number)
49207257485557923257…12541005377845002239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.841 × 10⁹⁵(96-digit number)
98414514971115846515…25082010755690004479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.968 × 10⁹⁶(97-digit number)
19682902994223169303…50164021511380008959
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,841,111 XPM·at block #6,824,630 · 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