Block #186,659

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/30/2013, 1:02:25 AM · Difficulty 9.8670 · 6,620,912 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c4126e24f2d70ed2875414e7b1efdc2ca35258ec28e03e2863f1446c71704ef

Height

#186,659

Difficulty

9.866964

Transactions

4

Size

1.07 KB

Version

2

Bits

09ddf156

Nonce

260,948

Timestamp

9/30/2013, 1:02:25 AM

Confirmations

6,620,912

Merkle Root

265f3f03dfa87edd177be82ebc3d0a43aba46e5f994687264d614fd209dcf52a
Transactions (4)
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.050 × 10⁹²(93-digit number)
20501288566039976976…53637855527638616959
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.050 × 10⁹²(93-digit number)
20501288566039976976…53637855527638616959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.100 × 10⁹²(93-digit number)
41002577132079953953…07275711055277233919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.200 × 10⁹²(93-digit number)
82005154264159907907…14551422110554467839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.640 × 10⁹³(94-digit number)
16401030852831981581…29102844221108935679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.280 × 10⁹³(94-digit number)
32802061705663963162…58205688442217871359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.560 × 10⁹³(94-digit number)
65604123411327926325…16411376884435742719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.312 × 10⁹⁴(95-digit number)
13120824682265585265…32822753768871485439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.624 × 10⁹⁴(95-digit number)
26241649364531170530…65645507537742970879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.248 × 10⁹⁴(95-digit number)
52483298729062341060…31291015075485941759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.049 × 10⁹⁵(96-digit number)
10496659745812468212…62582030150971883519
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,704,599 XPM·at block #6,807,570 · 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