Block #506,949

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2014, 9:57:35 AM · Difficulty 10.8158 · 6,303,225 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
af1916717918ca0cf37ef212f965058b102280117aad433192d9bfe5e982b019

Height

#506,949

Difficulty

10.815820

Transactions

10

Size

3.12 KB

Version

2

Bits

0ad0d990

Nonce

123,832,281

Timestamp

4/23/2014, 9:57:35 AM

Confirmations

6,303,225

Merkle Root

fb0d8d99e85a7b9b20856348d345a7dbe96c045240a320e631dba74b1ed223f1
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.434 × 10⁹⁸(99-digit number)
14344959165549532241…36682670762624839039
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.434 × 10⁹⁸(99-digit number)
14344959165549532241…36682670762624839039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.868 × 10⁹⁸(99-digit number)
28689918331099064483…73365341525249678079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.737 × 10⁹⁸(99-digit number)
57379836662198128967…46730683050499356159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.147 × 10⁹⁹(100-digit number)
11475967332439625793…93461366100998712319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.295 × 10⁹⁹(100-digit number)
22951934664879251587…86922732201997424639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.590 × 10⁹⁹(100-digit number)
45903869329758503174…73845464403994849279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.180 × 10⁹⁹(100-digit number)
91807738659517006348…47690928807989698559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.836 × 10¹⁰⁰(101-digit number)
18361547731903401269…95381857615979397119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.672 × 10¹⁰⁰(101-digit number)
36723095463806802539…90763715231958794239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.344 × 10¹⁰⁰(101-digit number)
73446190927613605078…81527430463917588479
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,725,460 XPM·at block #6,810,173 · 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