Block #1,610,084

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2016, 8:46:38 PM · Difficulty 10.6116 · 5,207,877 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b3133a3467036085be6fb541f2305a7e8f3f4d8494a7e904168aadf7b925957d

Height

#1,610,084

Difficulty

10.611614

Transactions

3

Size

3.82 KB

Version

2

Bits

0a9c92c0

Nonce

1,502,141,529

Timestamp

6/1/2016, 8:46:38 PM

Confirmations

5,207,877

Merkle Root

b61ef0fa2b1d700253614b9c6e4de4041f1a3a744c29091453f75ba958207488
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.441 × 10⁹⁵(96-digit number)
14414221314205694154…71471434701162573439
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.441 × 10⁹⁵(96-digit number)
14414221314205694154…71471434701162573439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.882 × 10⁹⁵(96-digit number)
28828442628411388308…42942869402325146879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.765 × 10⁹⁵(96-digit number)
57656885256822776616…85885738804650293759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.153 × 10⁹⁶(97-digit number)
11531377051364555323…71771477609300587519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.306 × 10⁹⁶(97-digit number)
23062754102729110646…43542955218601175039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.612 × 10⁹⁶(97-digit number)
46125508205458221293…87085910437202350079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.225 × 10⁹⁶(97-digit number)
92251016410916442586…74171820874404700159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.845 × 10⁹⁷(98-digit number)
18450203282183288517…48343641748809400319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.690 × 10⁹⁷(98-digit number)
36900406564366577034…96687283497618800639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.380 × 10⁹⁷(98-digit number)
73800813128733154069…93374566995237601279
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,787,757 XPM·at block #6,817,960 · 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