Block #1,390,514

1CCLength 10ā˜…ā˜…ā˜†ā˜†ā˜†

Cunningham Chain of the First Kind Ā· Discovered 12/29/2015, 7:19:24 PM Ā· Difficulty 10.8084 Ā· 5,427,232 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9c1c58c55e325216e9a7f6ca8b7a074845c8ce636da04bcd06886c08d76069c6

Height

#1,390,514

Difficulty

10.808392

Transactions

2

Size

1.08 KB

Version

2

Bits

0acef2ce

Nonce

1,646,174,431

Timestamp

12/29/2015, 7:19:24 PM

Confirmations

5,427,232

Mined by

Merkle Root

7e57f59dc380e5e7885d63ce95f834351c418cf46ed90502f1a62e68f3b887de
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.234 Ɨ 10⁹⁵(96-digit number)
12344837610701448064…11250829353373183999
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.234 Ɨ 10⁹⁵(96-digit number)
12344837610701448064…11250829353373183999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
2
2^1 Ɨ origin āˆ’ 1
2.468 Ɨ 10⁹⁵(96-digit number)
24689675221402896128…22501658706746367999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
3
2^2 Ɨ origin āˆ’ 1
4.937 Ɨ 10⁹⁵(96-digit number)
49379350442805792256…45003317413492735999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
4
2^3 Ɨ origin āˆ’ 1
9.875 Ɨ 10⁹⁵(96-digit number)
98758700885611584512…90006634826985471999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
5
2^4 Ɨ origin āˆ’ 1
1.975 Ɨ 10⁹⁶(97-digit number)
19751740177122316902…80013269653970943999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
6
2^5 Ɨ origin āˆ’ 1
3.950 Ɨ 10⁹⁶(97-digit number)
39503480354244633804…60026539307941887999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
7
2^6 Ɨ origin āˆ’ 1
7.900 Ɨ 10⁹⁶(97-digit number)
79006960708489267609…20053078615883775999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
8
2^7 Ɨ origin āˆ’ 1
1.580 Ɨ 10⁹⁷(98-digit number)
15801392141697853521…40106157231767551999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
9
2^8 Ɨ origin āˆ’ 1
3.160 Ɨ 10⁹⁷(98-digit number)
31602784283395707043…80212314463535103999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
10
2^9 Ɨ origin āˆ’ 1
6.320 Ɨ 10⁹⁷(98-digit number)
63205568566791414087…60424628927070207999
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,786,021 XPMĀ·at block #6,817,745 Ā· 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