Block #600,111

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/24/2014, 6:12:14 AM · Difficulty 10.9233 · 6,209,769 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cd694abc5d085aa6bb957cf96cefc412e5e988bffe32056516f8e04f6b89c886

Height

#600,111

Difficulty

10.923343

Transactions

8

Size

45.99 KB

Version

2

Bits

0aec602e

Nonce

489,998

Timestamp

6/24/2014, 6:12:14 AM

Confirmations

6,209,769

Merkle Root

6602a160031ef5ae00285803bedbea938f2e1a4c952109ec04c3f601f51031be
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.

6.419 × 10¹⁰⁰(101-digit number)
64190788459140038389…86074385531769905199
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
6.419 × 10¹⁰⁰(101-digit number)
64190788459140038389…86074385531769905199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.283 × 10¹⁰¹(102-digit number)
12838157691828007677…72148771063539810399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.567 × 10¹⁰¹(102-digit number)
25676315383656015355…44297542127079620799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.135 × 10¹⁰¹(102-digit number)
51352630767312030711…88595084254159241599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.027 × 10¹⁰²(103-digit number)
10270526153462406142…77190168508318483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.054 × 10¹⁰²(103-digit number)
20541052306924812284…54380337016636966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.108 × 10¹⁰²(103-digit number)
41082104613849624569…08760674033273932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.216 × 10¹⁰²(103-digit number)
82164209227699249138…17521348066547865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.643 × 10¹⁰³(104-digit number)
16432841845539849827…35042696133095731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.286 × 10¹⁰³(104-digit number)
32865683691079699655…70085392266191462399
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,723,126 XPM·at block #6,809,879 · 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.

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