Block #224,517

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/23/2013, 8:01:00 PM · Difficulty 9.9370 · 6,586,534 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f0166828f7f9ca102ddc46b711d1d0a63584a5b59a067131721a7d6153ca85d6

Height

#224,517

Difficulty

9.937029

Transactions

4

Size

1.66 KB

Version

2

Bits

09efe122

Nonce

424,999

Timestamp

10/23/2013, 8:01:00 PM

Confirmations

6,586,534

Merkle Root

bd711125829b486dc3464729552ce013c39568af0c99dd31a1c69ad1914ec6ee
Transactions (4)
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.659 × 10⁹⁴(95-digit number)
16591386455928608630…67338623843920827519
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.659 × 10⁹⁴(95-digit number)
16591386455928608630…67338623843920827519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.318 × 10⁹⁴(95-digit number)
33182772911857217261…34677247687841655039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.636 × 10⁹⁴(95-digit number)
66365545823714434522…69354495375683310079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.327 × 10⁹⁵(96-digit number)
13273109164742886904…38708990751366620159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.654 × 10⁹⁵(96-digit number)
26546218329485773808…77417981502733240319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.309 × 10⁹⁵(96-digit number)
53092436658971547617…54835963005466480639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.061 × 10⁹⁶(97-digit number)
10618487331794309523…09671926010932961279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.123 × 10⁹⁶(97-digit number)
21236974663588619047…19343852021865922559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.247 × 10⁹⁶(97-digit number)
42473949327177238094…38687704043731845119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.494 × 10⁹⁶(97-digit number)
84947898654354476188…77375408087463690239
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,732,520 XPM·at block #6,811,050 · 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