Block #1,155,387

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/14/2015, 9:45:41 PM · Difficulty 10.9459 · 5,669,908 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e96a7619dc79df6714d1f72a928e02006ba2e03a76ac318db23df56e5c33dc44

Height

#1,155,387

Difficulty

10.945894

Transactions

10

Size

8.28 KB

Version

2

Bits

0af22618

Nonce

52,761,358

Timestamp

7/14/2015, 9:45:41 PM

Confirmations

5,669,908

Merkle Root

a51007f467117cea06cae0a427addb16e69f7bc5a0f5a3cd4b7284c80e4b5734
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.781 × 10⁹⁵(96-digit number)
17816891903329431808…09390851630194891519
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.781 × 10⁹⁵(96-digit number)
17816891903329431808…09390851630194891519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.563 × 10⁹⁵(96-digit number)
35633783806658863616…18781703260389783039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.126 × 10⁹⁵(96-digit number)
71267567613317727233…37563406520779566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.425 × 10⁹⁶(97-digit number)
14253513522663545446…75126813041559132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.850 × 10⁹⁶(97-digit number)
28507027045327090893…50253626083118264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.701 × 10⁹⁶(97-digit number)
57014054090654181786…00507252166236528639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.140 × 10⁹⁷(98-digit number)
11402810818130836357…01014504332473057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.280 × 10⁹⁷(98-digit number)
22805621636261672714…02029008664946114559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.561 × 10⁹⁷(98-digit number)
45611243272523345429…04058017329892229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.122 × 10⁹⁷(98-digit number)
91222486545046690858…08116034659784458239
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,846,460 XPM·at block #6,825,294 · 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