Block #283,663

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/29/2013, 8:09:02 PM · Difficulty 9.9814 · 6,549,105 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
daa6f9a44ce668c5dfc0cc178b8e51efc5702f71dc17f484c993a9a8cc9f2644

Height

#283,663

Difficulty

9.981445

Transactions

4

Size

1.44 KB

Version

2

Bits

09fb3ffb

Nonce

65,653

Timestamp

11/29/2013, 8:09:02 PM

Confirmations

6,549,105

Merkle Root

609beb6ed5040fdacbb88f153955dcd9afcac99cf999b5d6a6c9256c8bf7d849
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.845 × 10⁹¹(92-digit number)
68456612185125869083…39119200226083659019
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.845 × 10⁹¹(92-digit number)
68456612185125869083…39119200226083659019
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.369 × 10⁹²(93-digit number)
13691322437025173816…78238400452167318039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.738 × 10⁹²(93-digit number)
27382644874050347633…56476800904334636079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.476 × 10⁹²(93-digit number)
54765289748100695267…12953601808669272159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.095 × 10⁹³(94-digit number)
10953057949620139053…25907203617338544319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.190 × 10⁹³(94-digit number)
21906115899240278106…51814407234677088639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.381 × 10⁹³(94-digit number)
43812231798480556213…03628814469354177279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.762 × 10⁹³(94-digit number)
87624463596961112427…07257628938708354559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.752 × 10⁹⁴(95-digit number)
17524892719392222485…14515257877416709119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.504 × 10⁹⁴(95-digit number)
35049785438784444970…29030515754833418239
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,906,308 XPM·at block #6,832,767 · 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