Block #464,435

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/28/2014, 6:55:45 PM · Difficulty 10.4215 · 6,343,360 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2087747640a039bdb8318768afdec54313acf996de563a27d9460cde4dcba27c

Height

#464,435

Difficulty

10.421502

Transactions

2

Size

1.77 KB

Version

2

Bits

0a6be793

Nonce

87,763

Timestamp

3/28/2014, 6:55:45 PM

Confirmations

6,343,360

Merkle Root

37c33cb0dca3757f1ad7001866d3205f1b032cc029a9c10c6f5ffa8b2c46a902
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.748 × 10⁹⁸(99-digit number)
17487090220944702602…08136689854932208639
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.748 × 10⁹⁸(99-digit number)
17487090220944702602…08136689854932208639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.497 × 10⁹⁸(99-digit number)
34974180441889405205…16273379709864417279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.994 × 10⁹⁸(99-digit number)
69948360883778810411…32546759419728834559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.398 × 10⁹⁹(100-digit number)
13989672176755762082…65093518839457669119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.797 × 10⁹⁹(100-digit number)
27979344353511524164…30187037678915338239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.595 × 10⁹⁹(100-digit number)
55958688707023048329…60374075357830676479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.119 × 10¹⁰⁰(101-digit number)
11191737741404609665…20748150715661352959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.238 × 10¹⁰⁰(101-digit number)
22383475482809219331…41496301431322705919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.476 × 10¹⁰⁰(101-digit number)
44766950965618438663…82992602862645411839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.953 × 10¹⁰⁰(101-digit number)
89533901931236877327…65985205725290823679
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,706,393 XPM·at block #6,807,794 · 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