Block #246,127

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/5/2013, 9:55:00 PM · Difficulty 9.9643 · 6,571,364 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6fc5a323f1cf5bc401c8ae40964dd1381b7b54116f8f4840658c141ef9b15fcb

Height

#246,127

Difficulty

9.964348

Transactions

2

Size

2.15 KB

Version

2

Bits

09f6df7c

Nonce

8,980

Timestamp

11/5/2013, 9:55:00 PM

Confirmations

6,571,364

Merkle Root

534eab8b7f0a23bc1217a10bf8eed8ad02665d6a1e5be48b394088324e970da3
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.

9.354 × 10⁹⁴(95-digit number)
93548334096015805747…54760769119739490199
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
9.354 × 10⁹⁴(95-digit number)
93548334096015805747…54760769119739490199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.870 × 10⁹⁵(96-digit number)
18709666819203161149…09521538239478980399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.741 × 10⁹⁵(96-digit number)
37419333638406322298…19043076478957960799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.483 × 10⁹⁵(96-digit number)
74838667276812644597…38086152957915921599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.496 × 10⁹⁶(97-digit number)
14967733455362528919…76172305915831843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.993 × 10⁹⁶(97-digit number)
29935466910725057839…52344611831663686399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.987 × 10⁹⁶(97-digit number)
59870933821450115678…04689223663327372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.197 × 10⁹⁷(98-digit number)
11974186764290023135…09378447326654745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.394 × 10⁹⁷(98-digit number)
23948373528580046271…18756894653309491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.789 × 10⁹⁷(98-digit number)
47896747057160092542…37513789306618982399
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,783,975 XPM·at block #6,817,490 · 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