Block #1,613,037

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/4/2016, 12:29:02 AM · Difficulty 10.5999 · 5,213,931 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e619890f8c86df39d4f07ad596ab7c6df2e7a84f429119c78348f48b56eef085

Height

#1,613,037

Difficulty

10.599884

Transactions

4

Size

5.74 KB

Version

2

Bits

0a999201

Nonce

446,634,588

Timestamp

6/4/2016, 12:29:02 AM

Confirmations

5,213,931

Merkle Root

678fe8d3e928bfc5157ffa2513fdf53bf4aaab283e6f7d5feec42b943b7e465f
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.203 × 10⁹⁵(96-digit number)
22035353490331303311…53263521899109673919
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.203 × 10⁹⁵(96-digit number)
22035353490331303311…53263521899109673919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.407 × 10⁹⁵(96-digit number)
44070706980662606623…06527043798219347839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.814 × 10⁹⁵(96-digit number)
88141413961325213247…13054087596438695679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.762 × 10⁹⁶(97-digit number)
17628282792265042649…26108175192877391359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.525 × 10⁹⁶(97-digit number)
35256565584530085299…52216350385754782719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.051 × 10⁹⁶(97-digit number)
70513131169060170598…04432700771509565439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.410 × 10⁹⁷(98-digit number)
14102626233812034119…08865401543019130879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.820 × 10⁹⁷(98-digit number)
28205252467624068239…17730803086038261759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.641 × 10⁹⁷(98-digit number)
56410504935248136478…35461606172076523519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.128 × 10⁹⁸(99-digit number)
11282100987049627295…70923212344153047039
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,859,920 XPM·at block #6,826,967 · 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