Block #368,694

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/20/2014, 9:36:57 PM · Difficulty 10.4447 · 6,458,448 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72de15f1ac69f5662f9a441ce3cd0a48348d75d8ccd35650d227d77362461e62

Height

#368,694

Difficulty

10.444664

Transactions

2

Size

1.25 KB

Version

2

Bits

0a71d583

Nonce

6,967

Timestamp

1/20/2014, 9:36:57 PM

Confirmations

6,458,448

Merkle Root

7f18a8c795b4c18a08cfa3d0b7b0cd7173ba898d4030d62f20b88982aeec6850
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.253 × 10⁹⁶(97-digit number)
22531672531140354717…30317355663103639999
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.253 × 10⁹⁶(97-digit number)
22531672531140354717…30317355663103639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.506 × 10⁹⁶(97-digit number)
45063345062280709435…60634711326207279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.012 × 10⁹⁶(97-digit number)
90126690124561418871…21269422652414559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.802 × 10⁹⁷(98-digit number)
18025338024912283774…42538845304829119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.605 × 10⁹⁷(98-digit number)
36050676049824567548…85077690609658239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.210 × 10⁹⁷(98-digit number)
72101352099649135097…70155381219316479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.442 × 10⁹⁸(99-digit number)
14420270419929827019…40310762438632959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.884 × 10⁹⁸(99-digit number)
28840540839859654038…80621524877265919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.768 × 10⁹⁸(99-digit number)
57681081679719308077…61243049754531839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.153 × 10⁹⁹(100-digit number)
11536216335943861615…22486099509063679999
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,861,318 XPM·at block #6,827,141 · 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