Block #617,853

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/5/2014, 8:07:46 AM · Difficulty 10.9465 · 6,196,273 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ad2c52e5013d4021d3f8ac898c683bd97efaf7f36c46c12292360cee403721a6

Height

#617,853

Difficulty

10.946543

Transactions

3

Size

658 B

Version

2

Bits

0af250a3

Nonce

639,653,233

Timestamp

7/5/2014, 8:07:46 AM

Confirmations

6,196,273

Merkle Root

46e8d74e22e39c1668448a1f505d4fd80ca2800499e90e3e8346687a6d116939
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.

8.137 × 10⁹⁴(95-digit number)
81370138517638114212…03638795272717146399
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
8.137 × 10⁹⁴(95-digit number)
81370138517638114212…03638795272717146399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.627 × 10⁹⁵(96-digit number)
16274027703527622842…07277590545434292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.254 × 10⁹⁵(96-digit number)
32548055407055245684…14555181090868585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.509 × 10⁹⁵(96-digit number)
65096110814110491369…29110362181737171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.301 × 10⁹⁶(97-digit number)
13019222162822098273…58220724363474342399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.603 × 10⁹⁶(97-digit number)
26038444325644196547…16441448726948684799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.207 × 10⁹⁶(97-digit number)
52076888651288393095…32882897453897369599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.041 × 10⁹⁷(98-digit number)
10415377730257678619…65765794907794739199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.083 × 10⁹⁷(98-digit number)
20830755460515357238…31531589815589478399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.166 × 10⁹⁷(98-digit number)
41661510921030714476…63063179631178956799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.332 × 10⁹⁷(98-digit number)
83323021842061428953…26126359262357913599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,757,092 XPM·at block #6,814,125 · 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