Block #263,805

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/18/2013, 3:41:32 AM · Difficulty 9.9655 · 6,561,791 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
35872de296d523a25761dc3fdb0cb2810c769b58963bcb7e995a8cda3a234056

Height

#263,805

Difficulty

9.965485

Transactions

1

Size

1.84 KB

Version

2

Bits

09f72a02

Nonce

432,851

Timestamp

11/18/2013, 3:41:32 AM

Confirmations

6,561,791

Merkle Root

423d91ff1b34a49cc3d8b25bf931b857d4bcc1c7f189b411324306d304d066e8
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.

7.094 × 10⁹⁴(95-digit number)
70946692470918424781…98519401500311307279
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
7.094 × 10⁹⁴(95-digit number)
70946692470918424781…98519401500311307279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.418 × 10⁹⁵(96-digit number)
14189338494183684956…97038803000622614559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.837 × 10⁹⁵(96-digit number)
28378676988367369912…94077606001245229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.675 × 10⁹⁵(96-digit number)
56757353976734739825…88155212002490458239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.135 × 10⁹⁶(97-digit number)
11351470795346947965…76310424004980916479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.270 × 10⁹⁶(97-digit number)
22702941590693895930…52620848009961832959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.540 × 10⁹⁶(97-digit number)
45405883181387791860…05241696019923665919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.081 × 10⁹⁶(97-digit number)
90811766362775583720…10483392039847331839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.816 × 10⁹⁷(98-digit number)
18162353272555116744…20966784079694663679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.632 × 10⁹⁷(98-digit number)
36324706545110233488…41933568159389327359
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,848,868 XPM·at block #6,825,595 · 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