Block #275,178

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/26/2013, 2:23:22 PM · Difficulty 9.9600 · 6,540,899 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
87fa6b64e3c4198b094a4eb6589c4712c3d8be0eadf68bcba5b0decbad8f380d

Height

#275,178

Difficulty

9.959989

Transactions

1

Size

1.11 KB

Version

2

Bits

09f5c1d8

Nonce

206,259

Timestamp

11/26/2013, 2:23:22 PM

Confirmations

6,540,899

Merkle Root

70d269a1df9f150a9266fb2f03b2b4bc0a6ad198c87b83b865a1f94258938e6d
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.492 × 10⁹¹(92-digit number)
44921803626205691134…50810160224961041119
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.492 × 10⁹¹(92-digit number)
44921803626205691134…50810160224961041119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.984 × 10⁹¹(92-digit number)
89843607252411382269…01620320449922082239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.796 × 10⁹²(93-digit number)
17968721450482276453…03240640899844164479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.593 × 10⁹²(93-digit number)
35937442900964552907…06481281799688328959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.187 × 10⁹²(93-digit number)
71874885801929105815…12962563599376657919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.437 × 10⁹³(94-digit number)
14374977160385821163…25925127198753315839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.874 × 10⁹³(94-digit number)
28749954320771642326…51850254397506631679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.749 × 10⁹³(94-digit number)
57499908641543284652…03700508795013263359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.149 × 10⁹⁴(95-digit number)
11499981728308656930…07401017590026526719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.299 × 10⁹⁴(95-digit number)
22999963456617313861…14802035180053053439
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,772,734 XPM·at block #6,816,076 · 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