Block #366,386

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2014, 9:16:46 AM · Difficulty 10.4300 · 6,450,056 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
96ac0b55c779a284779846811aa0884bf95de8fe049d1840a5ce053a3120c9c0

Height

#366,386

Difficulty

10.429968

Transactions

6

Size

1.47 KB

Version

2

Bits

0a6e125b

Nonce

330,378

Timestamp

1/19/2014, 9:16:46 AM

Confirmations

6,450,056

Merkle Root

963d52563f6c8880fb79a48f675c84929666cc067c29fb03eed5e3975b541666
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.380 × 10⁹³(94-digit number)
93801594502156865352…13827910653907679039
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.380 × 10⁹³(94-digit number)
93801594502156865352…13827910653907679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.876 × 10⁹⁴(95-digit number)
18760318900431373070…27655821307815358079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.752 × 10⁹⁴(95-digit number)
37520637800862746140…55311642615630716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.504 × 10⁹⁴(95-digit number)
75041275601725492281…10623285231261432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.500 × 10⁹⁵(96-digit number)
15008255120345098456…21246570462522864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.001 × 10⁹⁵(96-digit number)
30016510240690196912…42493140925045729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.003 × 10⁹⁵(96-digit number)
60033020481380393825…84986281850091458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.200 × 10⁹⁶(97-digit number)
12006604096276078765…69972563700182917119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.401 × 10⁹⁶(97-digit number)
24013208192552157530…39945127400365834239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.802 × 10⁹⁶(97-digit number)
48026416385104315060…79890254800731668479
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,775,662 XPM·at block #6,816,441 · 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