Block #653,873

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/29/2014, 7:56:57 PM · Difficulty 10.9552 · 6,160,979 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bd11b44b36a8b27807402dc289ab78e1fb5501fd7198eb3031f65549fc6dfa1e

Height

#653,873

Difficulty

10.955186

Transactions

4

Size

990 B

Version

2

Bits

0af48713

Nonce

268,233,561

Timestamp

7/29/2014, 7:56:57 PM

Confirmations

6,160,979

Merkle Root

3bcd55492e117573a530b5756d26c6e5f4c871f39022ec82b4b29f5fd0d7f2c7
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.091 × 10⁹⁴(95-digit number)
40918424977184112358…43438421338481689279
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.091 × 10⁹⁴(95-digit number)
40918424977184112358…43438421338481689279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.183 × 10⁹⁴(95-digit number)
81836849954368224716…86876842676963378559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.636 × 10⁹⁵(96-digit number)
16367369990873644943…73753685353926757119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.273 × 10⁹⁵(96-digit number)
32734739981747289886…47507370707853514239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.546 × 10⁹⁵(96-digit number)
65469479963494579772…95014741415707028479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.309 × 10⁹⁶(97-digit number)
13093895992698915954…90029482831414056959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.618 × 10⁹⁶(97-digit number)
26187791985397831909…80058965662828113919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.237 × 10⁹⁶(97-digit number)
52375583970795663818…60117931325656227839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.047 × 10⁹⁷(98-digit number)
10475116794159132763…20235862651312455679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.095 × 10⁹⁷(98-digit number)
20950233588318265527…40471725302624911359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.190 × 10⁹⁷(98-digit number)
41900467176636531054…80943450605249822719
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,762,899 XPM·at block #6,814,851 · 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