Block #1,612,467

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/3/2016, 2:39:44 PM · Difficulty 10.6015 · 5,226,781 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9e229bc5f1bca6531bd8e70c166947e74317d71a8136735cf41a67cb702b1463

Height

#1,612,467

Difficulty

10.601520

Transactions

8

Size

5.15 KB

Version

2

Bits

0a99fd38

Nonce

1,802,004,632

Timestamp

6/3/2016, 2:39:44 PM

Confirmations

5,226,781

Merkle Root

11f3b68916c4b02e047e1e4c9fd79853c90bc7a7ea81c611f2bc83f13e9ebe43
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.

9.909 × 10⁹³(94-digit number)
99094146037591567650…63508280356954652099
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
9.909 × 10⁹³(94-digit number)
99094146037591567650…63508280356954652099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.981 × 10⁹⁴(95-digit number)
19818829207518313530…27016560713909304199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.963 × 10⁹⁴(95-digit number)
39637658415036627060…54033121427818608399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.927 × 10⁹⁴(95-digit number)
79275316830073254120…08066242855637216799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.585 × 10⁹⁵(96-digit number)
15855063366014650824…16132485711274433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.171 × 10⁹⁵(96-digit number)
31710126732029301648…32264971422548867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.342 × 10⁹⁵(96-digit number)
63420253464058603296…64529942845097734399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.268 × 10⁹⁶(97-digit number)
12684050692811720659…29059885690195468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.536 × 10⁹⁶(97-digit number)
25368101385623441318…58119771380390937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.073 × 10⁹⁶(97-digit number)
50736202771246882637…16239542760781875199
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,958,266 XPM·at block #6,839,247 · 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