Block #368,931

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/21/2014, 1:34:45 AM · Difficulty 10.4446 · 6,445,921 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f85616da03909776be260489b02ead44c09a61a1a21d2a52030b0f89b0560b60

Height

#368,931

Difficulty

10.444621

Transactions

6

Size

1.45 KB

Version

2

Bits

0a71d2b0

Nonce

172,717

Timestamp

1/21/2014, 1:34:45 AM

Confirmations

6,445,921

Merkle Root

f518fcaa6359fcd1eca4b0b37377dda6c306dec59c18ab3edc0a394e295ebb65
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.

5.790 × 10⁹¹(92-digit number)
57904748769872362846…69211665391134182239
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
5.790 × 10⁹¹(92-digit number)
57904748769872362846…69211665391134182239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.158 × 10⁹²(93-digit number)
11580949753974472569…38423330782268364479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.316 × 10⁹²(93-digit number)
23161899507948945138…76846661564536728959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.632 × 10⁹²(93-digit number)
46323799015897890276…53693323129073457919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.264 × 10⁹²(93-digit number)
92647598031795780553…07386646258146915839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.852 × 10⁹³(94-digit number)
18529519606359156110…14773292516293831679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.705 × 10⁹³(94-digit number)
37059039212718312221…29546585032587663359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.411 × 10⁹³(94-digit number)
74118078425436624442…59093170065175326719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.482 × 10⁹⁴(95-digit number)
14823615685087324888…18186340130350653439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.964 × 10⁹⁴(95-digit number)
29647231370174649777…36372680260701306879
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,762,899 XPM·at block #6,814,851 · 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