Block #262,955

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/17/2013, 8:44:11 AM · Difficulty 9.9673 · 6,554,507 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec5f9f9d77d8876ca4f0ecf4f9ded70e7f4641cf975d61fa1ab8fa54ce2359c9

Height

#262,955

Difficulty

9.967347

Transactions

13

Size

4.63 KB

Version

2

Bits

09f7a40a

Nonce

5,690

Timestamp

11/17/2013, 8:44:11 AM

Confirmations

6,554,507

Merkle Root

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

7.891 × 10⁹⁴(95-digit number)
78914460280327749751…80870463947909084479
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
7.891 × 10⁹⁴(95-digit number)
78914460280327749751…80870463947909084479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.578 × 10⁹⁵(96-digit number)
15782892056065549950…61740927895818168959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.156 × 10⁹⁵(96-digit number)
31565784112131099900…23481855791636337919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.313 × 10⁹⁵(96-digit number)
63131568224262199800…46963711583272675839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.262 × 10⁹⁶(97-digit number)
12626313644852439960…93927423166545351679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.525 × 10⁹⁶(97-digit number)
25252627289704879920…87854846333090703359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.050 × 10⁹⁶(97-digit number)
50505254579409759840…75709692666181406719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.010 × 10⁹⁷(98-digit number)
10101050915881951968…51419385332362813439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.020 × 10⁹⁷(98-digit number)
20202101831763903936…02838770664725626879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.040 × 10⁹⁷(98-digit number)
40404203663527807872…05677541329451253759
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,783,746 XPM·at block #6,817,461 · 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