Block #264,610

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/18/2013, 8:34:41 PM · Difficulty 9.9640 · 6,543,397 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
56fe3e5820858a0938c0249c256658e7fd3af502cc2482b5387ce15a339f753f

Height

#264,610

Difficulty

9.964039

Transactions

2

Size

456 B

Version

2

Bits

09f6cb3b

Nonce

12,833

Timestamp

11/18/2013, 8:34:41 PM

Confirmations

6,543,397

Merkle Root

5fffdc576fad8f06ade718b4027b61a989c1cddfdcf00f6db4c72359bc102663
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.

1.215 × 10⁹⁵(96-digit number)
12158888122565680380…82069709966695843839
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
1.215 × 10⁹⁵(96-digit number)
12158888122565680380…82069709966695843839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.431 × 10⁹⁵(96-digit number)
24317776245131360760…64139419933391687679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.863 × 10⁹⁵(96-digit number)
48635552490262721521…28278839866783375359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.727 × 10⁹⁵(96-digit number)
97271104980525443043…56557679733566750719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.945 × 10⁹⁶(97-digit number)
19454220996105088608…13115359467133501439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.890 × 10⁹⁶(97-digit number)
38908441992210177217…26230718934267002879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.781 × 10⁹⁶(97-digit number)
77816883984420354435…52461437868534005759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.556 × 10⁹⁷(98-digit number)
15563376796884070887…04922875737068011519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.112 × 10⁹⁷(98-digit number)
31126753593768141774…09845751474136023039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.225 × 10⁹⁷(98-digit number)
62253507187536283548…19691502948272046079
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,708,097 XPM·at block #6,808,006 · 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