rework again

store/heightsub.go

@@ -92,7 +92,7 @@ func (hs *heightSub[H]) Pub(headers ...H) {
 	height := hs.Height()
 	from, to := headers[0].Height(), headers[ln-1].Height()
 	if height+1 != from && height != 0 { // height != 0 is needed to enable init from any height and not only 1
-		log.Fatalf("PLEASE FILE A BUG REPORT: headers given to the heightSub are in the wrong order: expected %d, got %d", height+1, from)
+		// log.Fatalf("PLEASE FILE A BUG REPORT: headers given to the heightSub are in the wrong order: expected %d, got %d", height+1, from)
 		return
 	}
 	hs.SetHeight(to)

store/store.go

@@ -324,12 +324,12 @@ func (s *Store[H]) Append(ctx context.Context, headers ...H) error {
 	for i, h := range headers {
 		// currently store requires all headers to be appended sequentially and adjacently
 		// TODO(@Wondertan): Further pruning friendly Store design should reevaluate this requirement
-		if h.Height() != head.Height()+1 {
-			return &header.ErrNonAdjacent{
-				Head:      head.Height(),
-				Attempted: h.Height(),
-			}
-		}
+		// if h.Height() != head.Height()+1 {
+		// 	return &header.ErrNonAdjacent{
+		// 		Head:      head.Height(),
+		// 		Attempted: h.Height(),
+		// 	}
+		// }
 
 		err = head.Verify(h)
 		if err != nil {

sync/sync_head.go

@@ -119,8 +119,8 @@ func (s *Syncer[H]) setSubjectiveHead(ctx context.Context, netHead H) {
 	//  * Remove ErrNonAdjacent
 	//  * Remove writeHead from the canonical store implementation
 	err := s.store.Append(ctx, netHead)
-	var nonAdj *header.ErrNonAdjacent
-	if err != nil && !errors.As(err, &nonAdj) {
+	// var nonAdj *header.ErrNonAdjacent
+	if err != nil { //&& !errors.As(err, &nonAdj) {
 		// might be a storage error or something else, but we can still try to continue processing netHead
 		log.Errorw("storing new network header",
 			"height", netHead.Height(),